ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  zindd Unicode version

Theorem zindd 9696
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.)
Hypotheses
Ref Expression
zindd.1  |-  ( x  =  0  ->  ( ph 
<->  ps ) )
zindd.2  |-  ( x  =  y  ->  ( ph 
<->  ch ) )
zindd.3  |-  ( x  =  ( y  +  1 )  ->  ( ph 
<->  ta ) )
zindd.4  |-  ( x  =  -u y  ->  ( ph 
<->  th ) )
zindd.5  |-  ( x  =  A  ->  ( ph 
<->  et ) )
zindd.6  |-  ( ze 
->  ps )
zindd.7  |-  ( ze 
->  ( y  e.  NN0  ->  ( ch  ->  ta ) ) )
zindd.8  |-  ( ze 
->  ( y  e.  NN  ->  ( ch  ->  th )
) )
Assertion
Ref Expression
zindd  |-  ( ze 
->  ( A  e.  ZZ  ->  et ) )
Distinct variable groups:    x, A    ch, x    et, x    ph, y    ps, x    ta, x    th, x    x, y, ze
Allowed substitution hints:    ph( x)    ps( y)    ch( y)    th( y)    ta( y)    et( y)    A( y)

Proof of Theorem zindd
StepHypRef Expression
1 znegcl 9608 . . . . . . 7  |-  ( y  e.  ZZ  ->  -u y  e.  ZZ )
2 elznn0nn 9591 . . . . . . 7  |-  ( -u y  e.  ZZ  <->  ( -u y  e.  NN0  \/  ( -u y  e.  RR  /\  -u -u y  e.  NN ) ) )
31, 2sylib 122 . . . . . 6  |-  ( y  e.  ZZ  ->  ( -u y  e.  NN0  \/  ( -u y  e.  RR  /\  -u -u y  e.  NN ) ) )
4 simpr 110 . . . . . . 7  |-  ( (
-u y  e.  RR  /\  -u -u y  e.  NN )  ->  -u -u y  e.  NN )
54orim2i 769 . . . . . 6  |-  ( (
-u y  e.  NN0  \/  ( -u y  e.  RR  /\  -u -u y  e.  NN ) )  -> 
( -u y  e.  NN0  \/  -u -u y  e.  NN ) )
63, 5syl 14 . . . . 5  |-  ( y  e.  ZZ  ->  ( -u y  e.  NN0  \/  -u -u y  e.  NN ) )
7 zcn 9582 . . . . . . . 8  |-  ( y  e.  ZZ  ->  y  e.  CC )
87negnegd 8575 . . . . . . 7  |-  ( y  e.  ZZ  ->  -u -u y  =  y )
98eleq1d 2301 . . . . . 6  |-  ( y  e.  ZZ  ->  ( -u -u y  e.  NN  <->  y  e.  NN ) )
109orbi2d 798 . . . . 5  |-  ( y  e.  ZZ  ->  (
( -u y  e.  NN0  \/  -u -u y  e.  NN ) 
<->  ( -u y  e. 
NN0  \/  y  e.  NN ) ) )
116, 10mpbid 147 . . . 4  |-  ( y  e.  ZZ  ->  ( -u y  e.  NN0  \/  y  e.  NN )
)
12 zindd.1 . . . . . . . 8  |-  ( x  =  0  ->  ( ph 
<->  ps ) )
1312imbi2d 230 . . . . . . 7  |-  ( x  =  0  ->  (
( ze  ->  ph )  <->  ( ze  ->  ps )
) )
14 zindd.2 . . . . . . . 8  |-  ( x  =  y  ->  ( ph 
<->  ch ) )
1514imbi2d 230 . . . . . . 7  |-  ( x  =  y  ->  (
( ze  ->  ph )  <->  ( ze  ->  ch )
) )
16 zindd.3 . . . . . . . 8  |-  ( x  =  ( y  +  1 )  ->  ( ph 
<->  ta ) )
1716imbi2d 230 . . . . . . 7  |-  ( x  =  ( y  +  1 )  ->  (
( ze  ->  ph )  <->  ( ze  ->  ta )
) )
18 zindd.4 . . . . . . . 8  |-  ( x  =  -u y  ->  ( ph 
<->  th ) )
1918imbi2d 230 . . . . . . 7  |-  ( x  =  -u y  ->  (
( ze  ->  ph )  <->  ( ze  ->  th )
) )
20 zindd.6 . . . . . . 7  |-  ( ze 
->  ps )
21 zindd.7 . . . . . . . . 9  |-  ( ze 
->  ( y  e.  NN0  ->  ( ch  ->  ta ) ) )
2221com12 30 . . . . . . . 8  |-  ( y  e.  NN0  ->  ( ze 
->  ( ch  ->  ta ) ) )
2322a2d 26 . . . . . . 7  |-  ( y  e.  NN0  ->  ( ( ze  ->  ch )  ->  ( ze  ->  ta ) ) )
2413, 15, 17, 19, 20, 23nn0ind 9692 . . . . . 6  |-  ( -u y  e.  NN0  ->  ( ze  ->  th ) )
2524com12 30 . . . . 5  |-  ( ze 
->  ( -u y  e. 
NN0  ->  th ) )
26 nnnn0 9503 . . . . . . . 8  |-  ( y  e.  NN  ->  y  e.  NN0 )
2713, 15, 17, 15, 20, 23nn0ind 9692 . . . . . . . 8  |-  ( y  e.  NN0  ->  ( ze 
->  ch ) )
2826, 27syl 14 . . . . . . 7  |-  ( y  e.  NN  ->  ( ze  ->  ch ) )
2928com12 30 . . . . . 6  |-  ( ze 
->  ( y  e.  NN  ->  ch ) )
30 zindd.8 . . . . . 6  |-  ( ze 
->  ( y  e.  NN  ->  ( ch  ->  th )
) )
3129, 30mpdd 41 . . . . 5  |-  ( ze 
->  ( y  e.  NN  ->  th ) )
3225, 31jaod 725 . . . 4  |-  ( ze 
->  ( ( -u y  e.  NN0  \/  y  e.  NN )  ->  th )
)
3311, 32syl5 32 . . 3  |-  ( ze 
->  ( y  e.  ZZ  ->  th ) )
3433ralrimiv 2614 . 2  |-  ( ze 
->  A. y  e.  ZZ  th )
35 znegcl 9608 . . . . 5  |-  ( x  e.  ZZ  ->  -u x  e.  ZZ )
36 negeq 8466 . . . . . . . . 9  |-  ( y  =  -u x  ->  -u y  =  -u -u x )
37 zcn 9582 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  e.  CC )
3837negnegd 8575 . . . . . . . . 9  |-  ( x  e.  ZZ  ->  -u -u x  =  x )
3936, 38sylan9eqr 2287 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  -u y  =  x )
4039eqcomd 2238 . . . . . . 7  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  x  =  -u y )
4140, 18syl 14 . . . . . 6  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  ( ph  <->  th )
)
4241bicomd 141 . . . . 5  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  ( th  <->  ph ) )
4335, 42rspcdv 2924 . . . 4  |-  ( x  e.  ZZ  ->  ( A. y  e.  ZZ  th 
->  ph ) )
4443com12 30 . . 3  |-  ( A. y  e.  ZZ  th  ->  ( x  e.  ZZ  ->  ph ) )
4544ralrimiv 2614 . 2  |-  ( A. y  e.  ZZ  th  ->  A. x  e.  ZZ  ph )
46 zindd.5 . . 3  |-  ( x  =  A  ->  ( ph 
<->  et ) )
4746rspccv 2918 . 2  |-  ( A. x  e.  ZZ  ph  ->  ( A  e.  ZZ  ->  et ) )
4834, 45, 473syl 17 1  |-  ( ze 
->  ( A  e.  ZZ  ->  et ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716    = wceq 1398    e. wcel 2203   A.wral 2520  (class class class)co 6050   RRcr 8126   0cc0 8127   1c1 8128    + caddc 8130   -ucneg 8445   NNcn 9237   NN0cn0 9496   ZZcz 9577
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-in1 619  ax-in2 620  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-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578
This theorem is referenced by:  efexp  12368  pcexp  13007  mulgaddcom  13863  mulginvcom  13864  mulgneg2  13873  mulgass2  14202  cnfldmulg  14724
  Copyright terms: Public domain W3C validator