Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > zindd | Unicode version |
Description: Principle of Mathematical Induction on all integers, deduction version. The first five hypotheses give the substitutions; the last three are the basis, the induction, and the extension to negative numbers. (Contributed by Paul Chapman, 17-Apr-2009.) (Proof shortened by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
zindd.1 | |
zindd.2 | |
zindd.3 | |
zindd.4 | |
zindd.5 | |
zindd.6 | |
zindd.7 | |
zindd.8 |
Ref | Expression |
---|---|
zindd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | znegcl 9085 | . . . . . . 7 | |
2 | elznn0nn 9068 | . . . . . . 7 | |
3 | 1, 2 | sylib 121 | . . . . . 6 |
4 | simpr 109 | . . . . . . 7 | |
5 | 4 | orim2i 750 | . . . . . 6 |
6 | 3, 5 | syl 14 | . . . . 5 |
7 | zcn 9059 | . . . . . . . 8 | |
8 | 7 | negnegd 8064 | . . . . . . 7 |
9 | 8 | eleq1d 2208 | . . . . . 6 |
10 | 9 | orbi2d 779 | . . . . 5 |
11 | 6, 10 | mpbid 146 | . . . 4 |
12 | zindd.1 | . . . . . . . 8 | |
13 | 12 | imbi2d 229 | . . . . . . 7 |
14 | zindd.2 | . . . . . . . 8 | |
15 | 14 | imbi2d 229 | . . . . . . 7 |
16 | zindd.3 | . . . . . . . 8 | |
17 | 16 | imbi2d 229 | . . . . . . 7 |
18 | zindd.4 | . . . . . . . 8 | |
19 | 18 | imbi2d 229 | . . . . . . 7 |
20 | zindd.6 | . . . . . . 7 | |
21 | zindd.7 | . . . . . . . . 9 | |
22 | 21 | com12 30 | . . . . . . . 8 |
23 | 22 | a2d 26 | . . . . . . 7 |
24 | 13, 15, 17, 19, 20, 23 | nn0ind 9165 | . . . . . 6 |
25 | 24 | com12 30 | . . . . 5 |
26 | nnnn0 8984 | . . . . . . . 8 | |
27 | 13, 15, 17, 15, 20, 23 | nn0ind 9165 | . . . . . . . 8 |
28 | 26, 27 | syl 14 | . . . . . . 7 |
29 | 28 | com12 30 | . . . . . 6 |
30 | zindd.8 | . . . . . 6 | |
31 | 29, 30 | mpdd 41 | . . . . 5 |
32 | 25, 31 | jaod 706 | . . . 4 |
33 | 11, 32 | syl5 32 | . . 3 |
34 | 33 | ralrimiv 2504 | . 2 |
35 | znegcl 9085 | . . . . 5 | |
36 | negeq 7955 | . . . . . . . . 9 | |
37 | zcn 9059 | . . . . . . . . . 10 | |
38 | 37 | negnegd 8064 | . . . . . . . . 9 |
39 | 36, 38 | sylan9eqr 2194 | . . . . . . . 8 |
40 | 39 | eqcomd 2145 | . . . . . . 7 |
41 | 40, 18 | syl 14 | . . . . . 6 |
42 | 41 | bicomd 140 | . . . . 5 |
43 | 35, 42 | rspcdv 2792 | . . . 4 |
44 | 43 | com12 30 | . . 3 |
45 | 44 | ralrimiv 2504 | . 2 |
46 | zindd.5 | . . 3 | |
47 | 46 | rspccv 2786 | . 2 |
48 | 34, 45, 47 | 3syl 17 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wo 697 wceq 1331 wcel 1480 wral 2416 (class class class)co 5774 cr 7619 cc0 7620 c1 7621 caddc 7623 cneg 7934 cn 8720 cn0 8977 cz 9054 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-z 9055 |
This theorem is referenced by: efexp 11388 |
Copyright terms: Public domain | W3C validator |