| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tfr0dm | Unicode version | ||
| Description: Transfinite recursion is defined at the empty set. (Contributed by Jim Kingdon, 8-Mar-2022.) |
| Ref | Expression |
|---|---|
| tfr.1 |
|
| Ref | Expression |
|---|---|
| tfr0dm |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ex 4260 |
. . . . 5
| |
| 2 | opexg 4368 |
. . . . 5
| |
| 3 | 1, 2 | mpan 428 |
. . . 4
|
| 4 | snidg 3738 |
. . . 4
| |
| 5 | 3, 4 | syl 14 |
. . 3
|
| 6 | fnsng 5428 |
. . . . 5
| |
| 7 | 1, 6 | mpan 428 |
. . . 4
|
| 8 | fvsng 5911 |
. . . . . . 7
| |
| 9 | 1, 8 | mpan 428 |
. . . . . 6
|
| 10 | res0 5067 |
. . . . . . 7
| |
| 11 | 10 | fveq2i 5698 |
. . . . . 6
|
| 12 | 9, 11 | eqtr4di 2289 |
. . . . 5
|
| 13 | fveq2 5695 |
. . . . . . 7
| |
| 14 | reseq2 5058 |
. . . . . . . 8
| |
| 15 | 14 | fveq2d 5699 |
. . . . . . 7
|
| 16 | 13, 15 | eqeq12d 2253 |
. . . . . 6
|
| 17 | 1, 16 | ralsn 3752 |
. . . . 5
|
| 18 | 12, 17 | sylibr 134 |
. . . 4
|
| 19 | suc0 4556 |
. . . . . 6
| |
| 20 | 0elon 4537 |
. . . . . . 7
| |
| 21 | 20 | onsuci 4663 |
. . . . . 6
|
| 22 | 19, 21 | eqeltrri 2312 |
. . . . 5
|
| 23 | fneq2 5470 |
. . . . . . 7
| |
| 24 | raleq 2749 |
. . . . . . 7
| |
| 25 | 23, 24 | anbi12d 477 |
. . . . . 6
|
| 26 | 25 | rspcev 2929 |
. . . . 5
|
| 27 | 22, 26 | mpan 428 |
. . . 4
|
| 28 | 7, 18, 27 | syl2anc 415 |
. . 3
|
| 29 | snexg 4321 |
. . . . 5
| |
| 30 | eleq2 2302 |
. . . . . . 7
| |
| 31 | fneq1 5469 |
. . . . . . . . 9
| |
| 32 | fveq1 5694 |
. . . . . . . . . . 11
| |
| 33 | reseq1 5057 |
. . . . . . . . . . . 12
| |
| 34 | 33 | fveq2d 5699 |
. . . . . . . . . . 11
|
| 35 | 32, 34 | eqeq12d 2253 |
. . . . . . . . . 10
|
| 36 | 35 | ralbidv 2550 |
. . . . . . . . 9
|
| 37 | 31, 36 | anbi12d 477 |
. . . . . . . 8
|
| 38 | 37 | rexbidv 2551 |
. . . . . . 7
|
| 39 | 30, 38 | anbi12d 477 |
. . . . . 6
|
| 40 | 39 | spcegv 2913 |
. . . . 5
|
| 41 | 3, 29, 40 | 3syl 17 |
. . . 4
|
| 42 | tfr.1 |
. . . . . 6
| |
| 43 | 42 | eleq2i 2305 |
. . . . 5
|
| 44 | df-recs 6576 |
. . . . . 6
| |
| 45 | 44 | eleq2i 2305 |
. . . . 5
|
| 46 | eluniab 3947 |
. . . . 5
| |
| 47 | 43, 45, 46 | 3bitri 206 |
. . . 4
|
| 48 | 41, 47 | imbitrrdi 162 |
. . 3
|
| 49 | 5, 28, 48 | mp2and 437 |
. 2
|
| 50 | opeldmg 4986 |
. . 3
| |
| 51 | 1, 50 | mpan 428 |
. 2
|
| 52 | 49, 51 | mpd 13 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-suc 4516 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-res 4786 df-iota 5337 df-fun 5379 df-fn 5380 df-fv 5385 df-recs 6576 |
| This theorem is used by: tfr0 6594 |
| Copyright terms: Public domain | W3C validator |