| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnind | Unicode version | ||
| Description: Principle of Mathematical Induction (inference schema). The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. See nnaddcl 9324 for an example of its use. This is an alternative for Metamath 100 proof #74. (Contributed by NM, 10-Jan-1997.) (Revised by Mario Carneiro, 16-Jun-2013.) |
| Ref | Expression |
|---|---|
| nnind.1 |
|
| nnind.2 |
|
| nnind.3 |
|
| nnind.4 |
|
| nnind.5 |
|
| nnind.6 |
|
| Ref | Expression |
|---|---|
| nnind |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1nn 9315 |
. . . . . 6
| |
| 2 | nnind.5 |
. . . . . 6
| |
| 3 | nnind.1 |
. . . . . . 7
| |
| 4 | 3 | elrab 2982 |
. . . . . 6
|
| 5 | 1, 2, 4 | mpbir2an 955 |
. . . . 5
|
| 6 | elrabi 2979 |
. . . . . . 7
| |
| 7 | peano2nn 9316 |
. . . . . . . . . 10
| |
| 8 | 7 | a1d 22 |
. . . . . . . . 9
|
| 9 | nnind.6 |
. . . . . . . . 9
| |
| 10 | 8, 9 | anim12d 335 |
. . . . . . . 8
|
| 11 | nnind.2 |
. . . . . . . . 9
| |
| 12 | 11 | elrab 2982 |
. . . . . . . 8
|
| 13 | nnind.3 |
. . . . . . . . 9
| |
| 14 | 13 | elrab 2982 |
. . . . . . . 8
|
| 15 | 10, 12, 14 | 3imtr4g 205 |
. . . . . . 7
|
| 16 | 6, 15 | mpcom 36 |
. . . . . 6
|
| 17 | 16 | rgen 2603 |
. . . . 5
|
| 18 | peano5nni 9307 |
. . . . 5
| |
| 19 | 5, 17, 18 | mp2an 430 |
. . . 4
|
| 20 | 19 | sseli 3244 |
. . 3
|
| 21 | nnind.4 |
. . . 4
| |
| 22 | 21 | elrab 2982 |
. . 3
|
| 23 | 20, 22 | sylib 122 |
. 2
|
| 24 | 23 | simprd 114 |
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-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-ext 2220 ax-sep 4249 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-iota 5337 df-fv 5385 df-ov 6088 df-inn 9305 |
| This theorem is used by: nnindALT 9321 nn1m1nn 9322 nnaddcl 9324 nnmulcl 9325 nnge1 9327 nn1gt1 9338 nnsub 9343 zaddcllempos 9681 zaddcllemneg 9683 nneoor 9748 peano5uzti 9754 nn0ind-raph 9763 indstr 9993 exbtwnzlemshrink 10683 exp3vallem 10977 expcllem 10987 expap0 11006 apexp1 11156 seq3coll 11294 resqrexlemover 11776 resqrexlemlo 11779 resqrexlemcalc3 11782 gcdmultiple 12797 rplpwr 12804 prmind2 12898 prmdvdsexp 12926 sqrt2irr 12940 pw2dvdslemn 12943 pcmpt 13122 prmpwdvds 13134 mulgnnass 13960 dvexp 15812 plycolemc 15859 2sqlem10 16244 |
| Copyright terms: Public domain | W3C validator |