![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > tfri2 | Unicode version |
Description: Principle of Transfinite
Recursion, part 2 of 3. Theorem 7.41(2) of
[TakeutiZaring] p. 47, with an
additional condition on the recursion
rule ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
tfri1.1 |
![]() ![]() ![]() ![]() ![]() ![]() |
tfri1.2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
tfri2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfri1.1 |
. . . . 5
![]() ![]() ![]() ![]() ![]() ![]() | |
2 | tfri1.2 |
. . . . 5
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 1, 2 | tfri1 6144 |
. . . 4
![]() ![]() ![]() ![]() |
4 | fndm 5126 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
5 | 3, 4 | ax-mp 7 |
. . 3
![]() ![]() ![]() ![]() ![]() |
6 | 5 | eleq2i 2155 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 1 | tfr2a 6100 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
8 | 6, 7 | sylbir 134 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 580 ax-in2 581 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-13 1450 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-coll 3960 ax-sep 3963 ax-pow 4015 ax-pr 4045 ax-un 4269 ax-setind 4366 |
This theorem depends on definitions: df-bi 116 df-3an 927 df-tru 1293 df-fal 1296 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ne 2257 df-ral 2365 df-rex 2366 df-reu 2367 df-rab 2369 df-v 2622 df-sbc 2842 df-csb 2935 df-dif 3002 df-un 3004 df-in 3006 df-ss 3013 df-nul 3288 df-pw 3435 df-sn 3456 df-pr 3457 df-op 3459 df-uni 3660 df-iun 3738 df-br 3852 df-opab 3906 df-mpt 3907 df-tr 3943 df-id 4129 df-iord 4202 df-on 4204 df-suc 4207 df-xp 4457 df-rel 4458 df-cnv 4459 df-co 4460 df-dm 4461 df-rn 4462 df-res 4463 df-ima 4464 df-iota 4993 df-fun 5030 df-fn 5031 df-f 5032 df-f1 5033 df-fo 5034 df-f1o 5035 df-fv 5036 df-recs 6084 |
This theorem is referenced by: tfri3 6146 |
Copyright terms: Public domain | W3C validator |