Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfis | Unicode version |
Description: Transfinite Induction Schema. If all ordinal numbers less than a given number have a property (induction hypothesis), then all ordinal numbers have the property (conclusion). Exercise 25 of [Enderton] p. 200. (Contributed by NM, 1-Aug-1994.) (Revised by Mario Carneiro, 20-Nov-2016.) |
Ref | Expression |
---|---|
tfis.1 |
Ref | Expression |
---|---|
tfis |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssrab2 3025 | . . . . 5 | |
2 | nfcv 2178 | . . . . . . 7 | |
3 | nfrab1 2489 | . . . . . . . . 9 | |
4 | 2, 3 | nfss 2938 | . . . . . . . 8 |
5 | 3 | nfcri 2172 | . . . . . . . 8 |
6 | 4, 5 | nfim 1464 | . . . . . . 7 |
7 | dfss3 2935 | . . . . . . . . 9 | |
8 | sseq1 2966 | . . . . . . . . 9 | |
9 | 7, 8 | syl5bbr 183 | . . . . . . . 8 |
10 | rabid 2485 | . . . . . . . . 9 | |
11 | eleq1 2100 | . . . . . . . . 9 | |
12 | 10, 11 | syl5bbr 183 | . . . . . . . 8 |
13 | 9, 12 | imbi12d 223 | . . . . . . 7 |
14 | sbequ 1721 | . . . . . . . . . . . 12 | |
15 | nfcv 2178 | . . . . . . . . . . . . 13 | |
16 | nfcv 2178 | . . . . . . . . . . . . 13 | |
17 | nfv 1421 | . . . . . . . . . . . . 13 | |
18 | nfs1v 1815 | . . . . . . . . . . . . 13 | |
19 | sbequ12 1654 | . . . . . . . . . . . . 13 | |
20 | 15, 16, 17, 18, 19 | cbvrab 2555 | . . . . . . . . . . . 12 |
21 | 14, 20 | elrab2 2700 | . . . . . . . . . . 11 |
22 | 21 | simprbi 260 | . . . . . . . . . 10 |
23 | 22 | ralimi 2384 | . . . . . . . . 9 |
24 | tfis.1 | . . . . . . . . 9 | |
25 | 23, 24 | syl5 28 | . . . . . . . 8 |
26 | 25 | anc2li 312 | . . . . . . 7 |
27 | 2, 6, 13, 26 | vtoclgaf 2618 | . . . . . 6 |
28 | 27 | rgen 2374 | . . . . 5 |
29 | tfi 4305 | . . . . 5 | |
30 | 1, 28, 29 | mp2an 402 | . . . 4 |
31 | 30 | eqcomi 2044 | . . 3 |
32 | 31 | rabeq2i 2554 | . 2 |
33 | 32 | simprbi 260 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wceq 1243 wcel 1393 wsb 1645 wral 2306 crab 2310 wss 2917 con0 4100 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-setind 4262 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-rab 2315 df-v 2559 df-in 2924 df-ss 2931 df-uni 3581 df-tr 3855 df-iord 4103 df-on 4105 |
This theorem is referenced by: tfis2f 4307 |
Copyright terms: Public domain | W3C validator |