Description: Transfinite Induction (inference schema), using implicit substitutions. The first three hypotheses establish the substitutions we need. The last three are the basis and the induction hypotheses (for successor and limit ordinals respectively). Theorem Schema 4 of Suppes p. 197. The wff ta is an auxiliary antecedent to help shorten proofs using this theorem. (Contributed by NM, 4-Sep-2004)
Ref | Expression | ||
---|---|---|---|
Hypotheses | tfinds2.1 | |
|
tfinds2.2 | |
||
tfinds2.3 | |
||
tfinds2.4 | |
||
tfinds2.5 | |
||
tfinds2.6 | |
||
Assertion | tfinds2 | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfinds2.1 | |
|
2 | tfinds2.2 | |
|
3 | tfinds2.3 | |
|
4 | tfinds2.4 | |
|
5 | tfinds2.5 | |
|
6 | tfinds2.6 | |
|
7 | 0ex | |
|
8 | 1 | imbi2d | |
9 | 7 8 | sbcie | |
10 | 4 9 | mpbir | |
11 | 5 | a2d | |
12 | 11 | sbcth | |
13 | 12 | elv | |
14 | sbcimg | |
|
15 | 14 | elv | |
16 | 13 15 | mpbi | |
17 | sbcel1v | |
|
18 | sbcimg | |
|
19 | 18 | elv | |
20 | 16 17 19 | 3imtr3i | |
21 | vex | |
|
22 | 2 | bicomd | |
23 | 22 | equcoms | |
24 | 23 | imbi2d | |
25 | 21 24 | sbcie | |
26 | vex | |
|
27 | 26 | sucex | |
28 | 3 | imbi2d | |
29 | 27 28 | sbcie | |
30 | 29 | sbcbii | |
31 | suceq | |
|
32 | 31 | sbcco2 | |
33 | 30 32 | bitr3i | |
34 | 20 25 33 | 3imtr3g | |
35 | 2 | imbi2d | |
36 | 35 | sbralie | |
37 | sbsbc | |
|
38 | 36 37 | bitr2i | |
39 | r19.21v | |
|
40 | 6 | a2d | |
41 | 39 40 | biimtrid | |
42 | 41 | sbcth | |
43 | 42 | elv | |
44 | sbcimg | |
|
45 | 44 | elv | |
46 | 43 45 | mpbi | |
47 | limeq | |
|
48 | 26 47 | sbcie | |
49 | sbcimg | |
|
50 | 49 | elv | |
51 | 46 48 50 | 3imtr3i | |
52 | 38 51 | biimtrrid | |
53 | 10 34 52 | tfindes | |