| 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 9257 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 9248 |
. . . . . 6
| |
| 2 | nnind.5 |
. . . . . 6
| |
| 3 | nnind.1 |
. . . . . . 7
| |
| 4 | 3 | elrab 2973 |
. . . . . 6
|
| 5 | 1, 2, 4 | mpbir2an 951 |
. . . . 5
|
| 6 | elrabi 2970 |
. . . . . . 7
| |
| 7 | peano2nn 9249 |
. . . . . . . . . 10
| |
| 8 | 7 | a1d 22 |
. . . . . . . . 9
|
| 9 | nnind.6 |
. . . . . . . . 9
| |
| 10 | 8, 9 | anim12d 335 |
. . . . . . . 8
|
| 11 | nnind.2 |
. . . . . . . . 9
| |
| 12 | 11 | elrab 2973 |
. . . . . . . 8
|
| 13 | nnind.3 |
. . . . . . . . 9
| |
| 14 | 13 | elrab 2973 |
. . . . . . . 8
|
| 15 | 10, 12, 14 | 3imtr4g 205 |
. . . . . . 7
|
| 16 | 6, 15 | mpcom 36 |
. . . . . 6
|
| 17 | 16 | rgen 2595 |
. . . . 5
|
| 18 | peano5nni 9240 |
. . . . 5
| |
| 19 | 5, 17, 18 | mp2an 426 |
. . . 4
|
| 20 | 19 | sseli 3234 |
. . 3
|
| 21 | nnind.4 |
. . . 4
| |
| 22 | 21 | elrab 2973 |
. . 3
|
| 23 | 20, 22 | sylib 122 |
. 2
|
| 24 | 23 | simprd 114 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 ax-sep 4228 ax-cnex 8218 ax-resscn 8219 ax-1re 8221 ax-addrcl 8224 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2815 df-un 3215 df-in 3217 df-ss 3224 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-br 4110 df-iota 5312 df-fv 5360 df-ov 6053 df-inn 9238 |
| This theorem is referenced by: nnindALT 9254 nn1m1nn 9255 nnaddcl 9257 nnmulcl 9258 nnge1 9260 nn1gt1 9271 nnsub 9276 zaddcllempos 9614 zaddcllemneg 9616 nneoor 9680 peano5uzti 9686 nn0ind-raph 9695 indstr 9925 exbtwnzlemshrink 10608 exp3vallem 10902 expcllem 10912 expap0 10931 apexp1 11080 seq3coll 11214 resqrexlemover 11695 resqrexlemlo 11698 resqrexlemcalc3 11701 gcdmultiple 12716 rplpwr 12723 prmind2 12817 prmdvdsexp 12845 sqrt2irr 12859 pw2dvdslemn 12862 pcmpt 13041 prmpwdvds 13053 mulgnnass 13874 dvexp 15576 plycolemc 15623 2sqlem10 15998 |
| Copyright terms: Public domain | W3C validator |