| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Principle of Finite Induction (inference schema), using implicit substitutions. The first three hypotheses establish the substitutions we need. The last two are the basis and the induction hypothesis. Theorem Schema 22 of [Suppes] p. 136. |
| Ref | Expression |
|---|---|
| finds1.1 |
|
| finds1.2 |
|
| finds1.3 |
|
| finds1.4 |
|
| finds1.5 |
|
| Ref | Expression |
|---|---|
| finds1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 1518 |
. 2
| |
| 2 | finds1.1 |
. . 3
| |
| 3 | finds1.2 |
. . 3
| |
| 4 | finds1.3 |
. . 3
| |
| 5 | finds1.4 |
. . . 4
| |
| 6 | 5 | a1i 8 |
. . 3
|
| 7 | finds1.5 |
. . . 4
| |
| 8 | 7 | a1d 12 |
. . 3
|
| 9 | 2, 3, 4, 6, 8 | finds2 3246 |
. 2
|
| 10 | 1, 9 | mpi 44 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ac6sfi 4591 unifi 4701 fodomfi 4709 pwfi 4714 expus 10938 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 998 ax-gen 999 ax-8 1000 ax-10 1002 ax-11 1003 ax-12 1004 ax-13 1005 ax-14 1006 ax-17 1007 ax-4 1009 ax-5o 1011 ax-6o 1014 ax-9o 1159 ax-10o 1177 ax-16 1247 ax-11o 1255 ax-ext 1500 ax-sep 2777 ax-nul 2784 ax-pow 2818 ax-pr 2855 ax-un 3089 |
| This theorem depends on definitions: df-bi 145 df-or 222 df-an 223 df-3or 782 df-3an 783 df-ex 1017 df-sb 1209 df-eu 1421 df-mo 1422 df-clab 1506 df-cleq 1511 df-clel 1514 df-ne 1630 df-ral 1695 df-rex 1696 df-v 1858 df-dif 2101 df-un 2102 df-in 2103 df-ss 2105 df-nul 2333 df-if 2416 df-pw 2459 df-sn 2470 df-pr 2471 df-tp 2473 df-op 2474 df-uni 2570 df-br 2693 df-opab 2741 df-tr 2755 df-eprel 2910 df-po 2918 df-so 2929 df-fr 2947 df-we 2962 df-ord 2978 df-on 2979 df-lim 2980 df-suc 2981 df-om 3219 |