Debian Codegraph @

examples/ordinals/FAN/ucomp.scm

raw
1
2 ; (load "~/minlog/init.scm")
3
4
5 (display "
6 Begin of ucomp.scm
7
8 In this file we define Ucompliment of a bar
9 and show some theorems.
10
11 We load first bar.scm
12 which contains some basic definitions.
13
14 ")
15
16 (exload "FAN/bar.scm")
17
18
19 (begin
20
21 (display "
22
23 BIG (f,n) iff {0,1}^n ⊆ f
24
25 ")
26 (add-program-constant
27 "BIG"
28 (mk-arrow (mk-arrow (py "pos") (py "boole")) (py "upos") (py "boole"))
29 1 'const 2)
30 ; COMPUTATION RULES
31 (add-computation-rule (pt "BIG f Unum")(pt "f 1"))
32 (add-computation-rule
33 (pt "BIG f (SUCC upos)")
34 (pt "TOT (f ∪ ([pos] (ℓ pos)◁(SUCC upos)) ) (Postoupos (₂ (SUCC upos)))"))
35
36 (display-program-constants "BIG"))
37
38 (av "e" (mk-arrow (py "upos") (py "pos")))
39
40 (display "
41
42 ∀ f,k,n (BIG f k ∧ ℓn=k) → fn
43
44 ")
45 (sg "all f,upos,pos.(BIG f upos ∧ ℓ pos=upos) → f pos")
46 (begin
47 (assume "f")
48 (cases)
49 (cases)
50 (auto)
51 (assume "upos")
52 (cases)
53 (use "Truth-Axiom")
54 (assume "pos")
55 (simp "lengthequal")
56 (cd "SZero(SZero pos)< ₂(SUCC(SUCC upos))" "n<2^k")
57 (cd "BIG f(SUCC upos)" "BIGfk+1")
58 (ng #t)
59 (simp(pf"(SZero pos< ₂upos∨f(SZero pos)) = ([pos0]f pos0 ∨ (pos0< ₂upos)) (SZero pos)"))
60 (use (pf "all f,upos,pos. (TOT f upos ∧ pos<Upostopos upos) -> f pos")
61 (pt"uposPLUS(Postoupos(₂upos))(Postoupos(₂upos))"))
62 (assume "g" "upos0" "pos0")
63 (use "BooleImp")
64 (auto)
65 (ng)
66 (simp "BIGfk+1")
67 (auto)
68 (ng #t)
69 (cases(pt"f(SZero pos)"))
70 (auto)
71 (assume "pos")
72 (simp "lengthequal")
73 (cd "SZero(SOne pos)< ₂(SUCC(SUCC upos))" "2n+1<2^(k+1)")
74 (cd "BIG f(SUCC upos)" "BIGfk+1")
75 (ng #t)
76 (simp(pf"(SZero pos< ₂upos∨f(SOne pos)) = ([pos0]f pos0 ∨ (pos0< ₂upos)) (SOne pos)"))
77 (use (pf "all f,upos,pos. (TOT f upos ∧ pos<Upostopos upos) -> f pos")
78 (pt"uposPLUS(Postoupos(₂upos))(Postoupos(₂upos))"))
79 (assume "g" "upos0" "pos0")
80 (use "BooleImp")
81 (auto)
82 (ng)
83 (simp "BIGfk+1")
84 (auto)
85 (ng #t)
86 (cases(pt"f(SOne pos)"))
87 (auto))
88 ; Proof finished.
89 (nrw "(BIG f upos ∧ ℓ pos=upos) → f pos")
90 (nrw "(ℓ pos=upos ∧ BIG f upos) → f pos")
91
92
93
94 (display "
95 bigintersect
96
97 ∀g,f,i . infpath(g) -> BIG(f,i) -> ∃n. (ℓn=i ∧ i∈g∩f)
98
99 PROOF:
100 ")
101 (sg "all g,f,upos.( " (∞ "g") " ) -> (BIG f upos) -> ex pos.(ℓ pos=upos ∧ g pos ∧ f pos)")
102 (begin
103 (assume "g" "f")
104 (cases)
105 (ng #t)
106 (assume "∞" "f1")
107 (inst-with-to "∞" (pt"Unum") "l=1")
108 (by-assume-with "l=1" "pos" "ln=1")
109 (ex-intro(pt"pos"))
110 (simp (pf"f pos"))
111 (use "ln=1")
112 (simp(pf"pos=1"))
113 (use "f1")
114 (use "BooleImp" (pt"ℓ pos=Unum "))
115 (auto)
116 (use-with "ln=1" 'left)
117 (assume "upos" "∞" "BIG (f n+1)")
118 (inst-with-to "∞" (pt"SUCC upos") "l=n+1")
119 (by-assume-with "l=n+1" "pos" "lk=n+1")
120 (ex-intro(pt"pos"))
121 (simp (pf"f pos"))
122 (use "lk=n+1")
123 (use
124 (pf "all upos.(BIG f upos ∧ ℓ pos=upos) -> f pos")
125 (pt"SUCC upos"))
126 (assume "upos0")
127 (use "BooleImp")
128 (auto)
129 (simp "BIG (f n+1)")
130 (simp-with "lk=n+1" 'left)
131 (use "Truth-Axiom"))
132 ; Proof finished.
133 (save "bigintersect")
134 (display-theorems "bigintersect")
135
136
137
138 (display "
139 notTOTchoice:
140
141 (∀f∀k) ∃n . (TOT f k) | (n<(Upostopos k) and ¬f n
142
143 ")
144 (sg "all f,upos.ex pos. (TOT f upos) ∨ (pos<(Upostopos upos) ∧ ¬(f pos))")
145 (begin
146 (assume "f")
147 (ind)
148 (ex-intro(pt"1"))
149 (use "Truth-Axiom")
150
151 (assume "upos" "IH")
152 (cd "TOT f(SUCC upos)" "total")
153 (ex-intro(pt"1"))
154 (use "Truth-Axiom")
155 (assume "nottot")
156
157 (cd "f (Upostopos upos)" "fn")
158 (by-assume-with "IH" "pos" "IH1")
159 (ex-intro(pt "pos"))
160 (ng #t)
161 (cut(pf"TOT f upos∨(pos<Upostopos upos∧ ¬(f pos))"))
162 (simp(pf"¬(TOT f upos)"))
163 (ng #t)
164 (cd "¬(f pos)" "¬fn")
165 (ng #t)
166 (assume "k<n")
167 (use "BooleImp" (pt"pos<Upostopos upos"))
168 (auto)
169 (cut(pf "( TOT f upos ∧ f(Upostopos upos)) → (TOT f (SUCC upos))"))
170 (simp "nottot")
171 (simp "fn")
172 (auto)
173 (assume "¬fn")
174 (ex-intro(pt "Upostopos upos"))
175 (simp "¬fn")
176 (use "Truth-Axiom"))
177 ; Proof finished.
178 (save "notTOTchoice")
179 (add-theorem "notTOTchoice_Soundness"
180 (proof-to-soundness-proof
181 (theorem-name-to-proof "notTOTchoice")))
182 (display-theorems "notTOTchoice")
183
184
185 (begin
186 (deanimate "notTOTchoice")
187 (animate "notTOTchoice")
188 (display-theorems "notTOTchoice")
189 (display "
190
191 TEST
192
193
194 cnotTOTchoice f upos
195 ")
196 (pnt "cnotTOTchoice f upos")
197 (display "
198 cnotTOTchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 4)
199 ")
200 (pnt "cnotTOTchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 4)")
201
202 (display "cnotTOTchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 25)
203 ")
204 (pnt "cnotTOTchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 25)")
205 (display "cnotTOTchoice (([pos] (ℓ pos)◁(Postoupos 3)) ∪ ([pos] (ℓ pos)=(Postoupos 5))) (Postoupos 16)
206 ")
207 (pnt "cnotTOTchoice (([pos] (ℓ pos)◁(Postoupos 3)) ∪ ([pos] (ℓ pos)=(Postoupos 5))) (Postoupos 16)")
208 (display "cnotTOTchoice (([pos] (ℓ pos)◁(Postoupos 3)) ∪ ([pos] (ℓ pos)=(Postoupos 5))) (Postoupos 23)
209 ")
210 (pnt "cnotTOTchoice (([pos] (ℓ pos)◁(Postoupos 3)) ∪ ([pos] (ℓ pos)=(Postoupos 5))) (Postoupos 23)")
211 (display "
212
213 ")
214 (deanimate "notTOTchoice")
215 )
216
217
218 (animate "notTOTchoice")
219 (sg "all f,upos. (TOT f upos) ∨ ((cnotTOTchoice f upos)<(Upostopos upos) ∧ ¬(f (cnotTOTchoice f upos)))")
220 (use "notTOTchoice_Soundness")
221 ; Proof finished.
222 (deanimate "notTOTchoice")
223 (nrw "(TOT f upos) ∨ ((cnotTOTchoice f upos)<(Upostopos upos) ∧ ¬(f (cnotTOTchoice f upos)))")
224
225
226 (display "
227 nonBIGchoice:
228
229 (∀f∀k) ∃n . (BIG f k) | ( (λi.(ℓi=k)) ∖ f) n
230
231 ")
232 (sg "all f,upos.ex pos1. (BIG f upos) ∨ (( ([pos] (ℓ pos)= upos) ∖ f ) pos1)")
233 (begin
234 (assume "f")
235 (cases)
236 (ex-intro(pt"1"))
237 (use "Truth-Axiom")
238 (assume "upos")
239 (ex-intro (pt "cnotTOTchoice (f∪([pos]ℓpos◁SUCC upos)) (Postoupos (₂ (SUCC upos)))"))
240 (simp
241 (pf"all pos.(([pos]ℓpos=SUCC upos)∖f)pos=
242 (pos<(₂(SUCC upos)) ∧ ¬((f∪([pos]ℓpos◁SUCC upos)) pos))"))
243 (cut
244 (pf"TOT (f∪([pos]ℓpos◁SUCC upos)) (Postoupos (₂ (SUCC upos))) ∨
245 ( ((cnotTOTchoice(f∪([pos]ℓpos◁SUCC upos))(Postoupos(₂(SUCC upos))))< ₂(SUCC upos))
246 ∧ ¬((f∪([pos]ℓpos◁SUCC upos))(cnotTOTchoice(f∪([pos]ℓpos◁SUCC upos))(Postoupos(₂(SUCC upos))))) )"))
247 (search)
248 (use-with
249 (pf "all f,upos.(TOT f upos) ∨ ((cnotTOTchoice f upos)<(Upostopos upos) ∧ ¬(f (cnotTOTchoice f upos)))")
250 (pt "(f∪([pos]ℓpos◁SUCC upos))") (pt"(Postoupos (₂ (SUCC upos)))"))
251 (search)
252 (assume "pos")
253 (ng #t)
254 (simp "lengthequal")
255 (ng #t)
256 (cases(pt"f pos"))
257 (auto)
258 (assume "¬fn")
259 (ng #t)
260 (use "ANDcomm"))
261 ; Proof finished.
262 (save "nonBIGchoice")
263 (add-theorem "nonBIGchoice_Soundness"
264 (proof-to-soundness-proof
265 (theorem-name-to-proof "nonBIGchoice")))
266 (display-theorems "nonBIGchoice")
267
268
269 (animate "nonBIGchoice")
270
271 (sg "all upos.BIG f upos∨ (ℓ(cnonBIGchoice f upos)=upos∧ ¬(f(cnonBIGchoice f upos)))")
272 (use "nonBIGchoice_Soundness")
273 ; Proof finished.
274 (nrw "BIG f upos∨ (ℓ(cnonBIGchoice f upos)=upos∧ ¬(f(cnonBIGchoice f upos)))")
275 ; (nrw "BIG f upos∨
276 ; (ℓ
277 ; [if upos
278 ; 1
279 ; ([upos0]
280 ; (Rec upos=>pos)1
281 ; ([upos1,pos2]
282 ; [if (TOT([pos3]f pos3∨pos3< ₂upos0)upos1∧
283 ; (f(Upostopos upos1)∨Upostopos upos1< ₂upos0))
284 ; 1
285 ; [if (f(Upostopos upos1)∨Upostopos upos1< ₂upos0)
286 ; pos2
287 ; (Upostopos upos1)]])
288 ; (uposPLUS(Postoupos₂upos0)(Postoupos₂upos0)))]=
289 ; upos∧
290 ; ¬
291 ; (f
292 ; [if upos
293 ; 1
294 ; ([upos0]
295 ; (Rec upos=>pos)1
296 ; ([upos1,pos2]
297 ; [if (TOT([pos3]f pos3∨pos3< ₂upos0)upos1∧
298 ; (f(Upostopos upos1)∨Upostopos upos1< ₂upos0))
299 ; 1
300 ; [if (f(Upostopos upos1)∨Upostopos upos1< ₂upos0)
301 ; pos2
302 ; (Upostopos upos1)]])
303 ; (uposPLUS(Postoupos₂upos0)(Postoupos₂upos0)))]))")
304 (deanimate "nonBIGchoice")
305
306
307
308 (sg "¬(¬(BIG f upos)∧f(cnonBIGchoice f upos))")
309 (begin
310 (assume "f" "upos")
311 (use "BooleImp" (pt"(BIG f upos) ∨ ((([pos] (ℓ pos)= upos) ∖ f ) (cnonBIGchoice f upos))"))
312 (cases(pt"BIG f upos"))
313 (auto))
314 ; Proof finished.
315 (nrw "¬(¬(BIG f upos)∧f(cnonBIGchoice f upos))")
316
317
318
319 (sg "(BIG f upos) ∨ (ℓ(cnonBIGchoice f upos)=upos)")
320 (assume "f" "upos")
321 (use (pf"all boole1,boole2,boole3.boole1∨(boole2∧boole3)->boole1∨boole2")
322 (pt "¬(f(cnonBIGchoice f upos))"))
323 (assume "boole1" "boole2" "boole3")
324 (use "BooleImp")
325 (auto)
326 ; Proof finished.
327 (nrw "(BIG f upos) ∨ (ℓ(cnonBIGchoice f upos)=upos)")
328
329
330
331 (begin
332 (deanimate "nonBIGchoice")
333 (deanimate "notTOTchoice")
334 (animate "notTOTchoice")
335 (animate "nonBIGchoice")
336
337 (display-theorems "nonBIGchoice")
338
339 (display "
340
341 TEST
342
343
344 cnonBIGchoice f upos
345 ")
346 (pnt "cnonBIGchoice f upos")
347 (display "cnonBIGchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 2)
348 ")
349 (pnt "cnonBIGchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 2)")
350 (display "cnonBIGchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 3)
351 ")
352 (pnt "cnonBIGchoice ([pos] (ℓ pos)◁(Postoupos 3)) (Postoupos 3)")
353 (display "cnonBIGchoice (([pos] (ℓ pos)◁(Postoupos 3)) ∪ ([pos] (ℓ pos)=(Postoupos 5))) (Postoupos 4)
354 ")
355 (pnt "cnonBIGchoice (([pos] (ℓ pos)◁(Postoupos 3)) ∪ ([pos] (ℓ pos)=(Postoupos 5))) (Postoupos 4)")
356 (display "
357
358 ")
359 (deanimate "nonBIGchoice")
360 (deanimate "notTOTchoice")
361 )
362
363
364
365
366 (begin
367 (deanimate "nonBIGchoice")
368 (deanimate "notTOTchoice")
369 (animate "notTOTchoice")
370 (animate "nonBIGchoice")
371 (display "
372
373 U : upos -> pos
374
375 ")
376 (add-program-constant
377 "U"
378 (mk-arrow (mk-arrow (py "pos") (py "boole")) (py "upos") (py "pos"))
379 1 'const 2)
380 ; COMPUTATION RULES
381 (add-computation-rule (pt "U f Unum")(pt "1"))
382 (add-computation-rule
383 (pt "U f (SUCC upos)")
384 (pt "[if (BIG f (SUCC upos)) (SZero (U f upos)) (cnonBIGchoice f (SUCC upos))]"))
385
386 (display-program-constants "U")
387 (display"
388
389 Test of U:
390
391 ")
392 (display "U ([pos](11<pos)) 3 ")
393 (pnt"U ([pos](11<pos)) (Postoupos 3)")
394 (display "U ([pos](11<pos)) 4 ")
395 (pnt"U ([pos](11<pos)) (Postoupos 4)")
396 (display "U ([pos](11<pos)) 5 ")
397 (pnt"U ([pos](11<pos)) (Postoupos 5)")
398 (deanimate "nonBIGchoice")
399 (deanimate "notTOTchoice"))
400
401
402
403
404 (begin
405 (deanimate "nonBIGchoice")
406 (deanimate "notTOTchoice")
407 (animate "notTOTchoice")
408 (animate "nonBIGchoice")
409 (display "
410
411 UCOMP : (pos -> boole) -> (pos -> boole)
412
413 ")
414 (add-program-constant
415 "UCOMP"
416 (mk-arrow (mk-arrow (py "pos") (py "boole")) (mk-arrow (py "pos") (py "boole")))
417 1 'const 2)
418 ; COMPUTATION RULES
419 (add-computation-rule (pt "UCOMP f pos")(pt "f pos → (pos = (U f (ℓ pos)))"))
420
421 (display-program-constants "UCOMP")
422 (display"
423
424 Test of UCOMP:
425
426 ")
427 (display "UCOMP ([pos](11<pos)) ")
428 (pnt"UCOMP ([pos](11<pos))")
429 (display "UCOMP ([pos](11<pos)) 3 ")
430 (pnt"UCOMP ([pos](11<pos)) 3")
431 (display "UCOMP ([pos](11<pos)) 11 ")
432 (pnt"UCOMP ([pos](11<pos)) 11")
433 (display "UCOMP ([pos](11<pos)) 12 ")
434 (pnt"UCOMP ([pos](11<pos)) 12")
435 (display "UCOMP ([pos](11<pos)) 22 ")
436 (pnt"UCOMP ([pos](11<pos)) 22")
437 (deanimate "nonBIGchoice")
438 (deanimate "notTOTchoice"))
439
440
441
442
443 (display "
444
445 ∀f ∀n. n ∈ [ (∁f)∪{u(i) : i∈ω} ∩ f ] -> BIG(f,ℓn)
446
447 ")
448 (sg "all pos.(pos=U f(ℓpos)∧f pos) → (BIG f (ℓ pos))")
449 (begin
450 (assume "f")
451 (cases)
452 (auto)
453
454 (assume "pos")
455 (cd "BIG f(ℓ(SZero pos))" "bigl+1")
456 (use "Truth-Axiom")
457 (assume "small(l+1)")
458 (ng)
459 (simp "small(l+1)")
460 (ng)
461 (cds "SZero pos=cnonBIGchoice f(SUCC(ℓ pos))" "2n=bigchoice(l+1)")
462 (ng #t)
463 (use "BooleImp" (pt"¬(BIG f (SUCC(ℓpos)))"))
464 (use (pf"all upos.BIG f upos∨ ¬(f(cnonBIGchoice f upos))"))
465 (auto)
466 (ng)
467 (simp "small(l+1)")
468 (use "Truth-Axiom")
469 (search)
470
471 (assume "pos")
472 (cd "BIG f(ℓ(SOne pos))" "bigl+1")
473 (use "Truth-Axiom")
474 (assume "small(l+1)")
475 (ng)
476 (simp "small(l+1)")
477 (ng)
478 (cds "SOne pos=cnonBIGchoice f(SUCC(ℓ pos))" "2n+1=bigchoice(l+1)")
479 (ng #t)
480 (use "BooleImp" (pt"¬(BIG f (SUCC(ℓpos)))"))
481 (use (pf"all upos.BIG f upos∨ ¬(f(cnonBIGchoice f upos))"))
482 (auto)
483 (ng)
484 (simp "small(l+1)")
485 (use "Truth-Axiom")
486 (search))
487 ; Proof finished.
488 (nrw "(pos=U f(ℓpos)∧f pos) → (BIG f (ℓ pos))")
489 (nrw "(f pos∧pos=U f(ℓpos)) → (BIG f (ℓ pos))")
490
491
492
493 (display "
494
495 ℓ(U f k)=k
496
497 ")
498 (sg "ℓ(U f upos)=upos")
499 (begin
500 (assume "f")
501 (ind)
502 (auto)
503 (assume "upos" "IH")
504 (ng)
505 (cd
506 "TOT ([pos](f pos ∨ (pos< ₂upos))) (uposPLUS (Postoupos(₂ upos))(Postoupos(₂ upos)))"
507 "big")
508 (auto)
509 (assume "small")
510 (ng)
511 (use "BooleImp" (pt"¬(BIG f (SUCC(upos)))"))
512 (use (pf"all upos.(BIG f upos) ∨ (ℓ(cnonBIGchoice f upos)=upos)"))
513 (auto)
514 (ng)
515 (simp "small")
516 (auto))
517 ; Proof finished.
518 (add-rewrite-rule(pt "ℓ(U f upos)")(pt"upos"))
519
520
521
522 (display "
523
524 UCOMP f is an infinite tree:
525
526 ")
527 (sg "all f." (∞ "(UCOMP f)"))
528 (assume "f" "upos")
529 (ex-intro(pt"U f upos"))
530 (use "Truth-Axiom")
531 ; Proof finished.
532 (save "UCOMPinfinite")
533 (display-theorems "UCOMPinfinite")
534
535
536
537
538 (display "
539
540 BAR f → TREE (UCOMP f)
541
542 ")
543 (sg"all f." (BAR "f") " -> "(TREE "(UCOMP f)"))
544 (begin
545 (assume "f" "bar" "pos")
546 (ng)
547 (cd "(TOT([pos0]f pos0∨pos0< ₂(ℓpos))(uposPLUS(Postoupos₂(ℓpos))(Postoupos₂(ℓpos))))" "big")
548 (ng)
549 (cases (pt"pos=U f(ℓpos)"))
550 (search)
551 (assume "n≠U f(ℓk)")
552 (ng)
553 (cut(pf"f pos → (f(SZero pos)∧ f(SOne pos))"))
554 (cd "f pos" "fn")
555 (auto)
556 (assume "small")
557 (ng)
558 (cases (pt"pos=U f(ℓpos)"))
559 (search)
560 (assume "n≠U f(ℓk)")
561 (ng)
562 (cd "SZero pos=cnonBIGchoice f(SUCC(ℓpos))" "2n=nbc fln+1")
563 (ng)
564 (simp (pf"¬(SOne pos=cnonBIGchoice f(SUCC(ℓpos)))"))
565 (ng)
566 (cut(pf"f pos → (f(SZero pos)∧ f(SOne pos))"))
567 (cd "f pos" "fn")
568 (simp"2n=nbc fln+1")
569 (ng #t)
570 (simp(pf"(f(cnonBIGchoice f (SUCC(ℓpos))))=False"))
571 (auto)
572 (use "BooleImp" (pt"¬(f(cnonBIGchoice f (SUCC(ℓpos))))"))
573 (auto)
574 (use "BooleImp" (pt"¬(¬(BIG f (SUCC(ℓpos)))∧f(cnonBIGchoice f (SUCC(ℓpos))))"))
575 (ng #t)
576 (simp "small")
577 (auto)
578 (use (pf"all upos.¬(¬(BIG f upos)∧f(cnonBIGchoice f upos))"))
579 (auto)
580 (simp "<-" "2n=nbc fln+1")
581 (auto)
582 (assume "2n≠nbc fln+1")
583 (ng)
584 (cd "SOne pos=cnonBIGchoice f(SUCC(ℓpos))" "2n+1=nbc fln+1")
585 (ng)
586 (cut(pf"f pos → (f(SZero pos)∧ f(SOne pos))"))
587 (cd "f pos" "fn")
588 (ng)
589 (simp"2n+1=nbc fln+1")
590 (use "BooleImp")
591 (use "BooleImp" (pt"¬(f(cnonBIGchoice f (SUCC(ℓpos))))"))
592 (auto)
593 (use "BooleImp" (pt"¬(¬(BIG f (SUCC(ℓpos)))∧f(cnonBIGchoice f (SUCC(ℓpos))))"))
594 (ng #t)
595 (simp "small")
596 (auto)
597 (simp(pf"(f(cnonBIGchoice f (SUCC(ℓpos))))=False"))
598 (auto)
599 (use "BooleImp" (pt"¬(f(cnonBIGchoice f (SUCC(ℓpos))))"))
600 (auto)
601 (use "BooleImp" (pt"¬(¬(BIG f (SUCC(ℓpos)))∧f(cnonBIGchoice f (SUCC(ℓpos))))"))
602 (ng #t)
603 (simp "small")
604 (auto)
605 (use (pf"all upos.¬(¬(BIG f upos)∧f(cnonBIGchoice f upos))"))
606 (auto)
607 (assume "2n+1≠nbc fln+1")
608 (ng)
609 (cut(pf"f pos → (f(SZero pos)∧ f(SOne pos))"))
610 (cd "f pos" "fn")
611 (auto))
612 ; Proof finished.
613 (save "UCOMPtree")
614 (display-theorems "UCOMPtree")
615
616
617
618
619 (display"
620
621 End of ucomp.scm
622 ")