Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > finds | Unicode version |
Description: Principle of Finite Induction (inference schema), using implicit substitutions. The first four hypotheses establish the substitutions we need. The last two are the basis and the induction step. Theorem Schema 22 of [Suppes] p. 136. This is Metamath 100 proof #74. (Contributed by NM, 14-Apr-1995.) |
Ref | Expression |
---|---|
finds.1 | |
finds.2 | |
finds.3 | |
finds.4 | |
finds.5 | |
finds.6 |
Ref | Expression |
---|---|
finds |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | finds.5 | . . . . 5 | |
2 | 0ex 4103 | . . . . . 6 | |
3 | finds.1 | . . . . . 6 | |
4 | 2, 3 | elab 2865 | . . . . 5 |
5 | 1, 4 | mpbir 145 | . . . 4 |
6 | finds.6 | . . . . . 6 | |
7 | vex 2724 | . . . . . . 7 | |
8 | finds.2 | . . . . . . 7 | |
9 | 7, 8 | elab 2865 | . . . . . 6 |
10 | 7 | sucex 4470 | . . . . . . 7 |
11 | finds.3 | . . . . . . 7 | |
12 | 10, 11 | elab 2865 | . . . . . 6 |
13 | 6, 9, 12 | 3imtr4g 204 | . . . . 5 |
14 | 13 | rgen 2517 | . . . 4 |
15 | peano5 4569 | . . . 4 | |
16 | 5, 14, 15 | mp2an 423 | . . 3 |
17 | 16 | sseli 3133 | . 2 |
18 | finds.4 | . . 3 | |
19 | 18 | elabg 2867 | . 2 |
20 | 17, 19 | mpbid 146 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1342 wcel 2135 cab 2150 wral 2442 wss 3111 c0 3404 csuc 4337 com 4561 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-nul 4102 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-iinf 4559 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-rex 2448 df-v 2723 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-nul 3405 df-pw 3555 df-sn 3576 df-pr 3577 df-uni 3784 df-int 3819 df-suc 4343 df-iom 4562 |
This theorem is referenced by: findes 4574 nn0suc 4575 elomssom 4576 ordom 4578 nndceq0 4589 0elnn 4590 omsinds 4593 nna0r 6437 nnm0r 6438 nnsucelsuc 6450 nneneq 6814 php5 6815 php5dom 6820 fidcenumlemrk 6910 fidcenumlemr 6911 nnnninfeq 7083 nnnninfeq2 7084 frec2uzltd 10328 frecuzrdgg 10341 seq3val 10383 seqvalcd 10384 omgadd 10704 zfz1iso 10740 ennnfonelemhom 12285 nninfsellemdc 13724 |
Copyright terms: Public domain | W3C validator |