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

Theorem zindd 9137
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 9053 . . . . . . 7  |-  ( y  e.  ZZ  ->  -u y  e.  ZZ )
2 elznn0nn 9036 . . . . . . 7  |-  ( -u y  e.  ZZ  <->  ( -u y  e.  NN0  \/  ( -u y  e.  RR  /\  -u -u y  e.  NN ) ) )
31, 2sylib 121 . . . . . 6  |-  ( y  e.  ZZ  ->  ( -u y  e.  NN0  \/  ( -u y  e.  RR  /\  -u -u y  e.  NN ) ) )
4 simpr 109 . . . . . . 7  |-  ( (
-u y  e.  RR  /\  -u -u y  e.  NN )  ->  -u -u y  e.  NN )
54orim2i 735 . . . . . 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 9027 . . . . . . . 8  |-  ( y  e.  ZZ  ->  y  e.  CC )
87negnegd 8032 . . . . . . 7  |-  ( y  e.  ZZ  ->  -u -u y  =  y )
98eleq1d 2186 . . . . . 6  |-  ( y  e.  ZZ  ->  ( -u -u y  e.  NN  <->  y  e.  NN ) )
109orbi2d 764 . . . . 5  |-  ( y  e.  ZZ  ->  (
( -u y  e.  NN0  \/  -u -u y  e.  NN ) 
<->  ( -u y  e. 
NN0  \/  y  e.  NN ) ) )
116, 10mpbid 146 . . . 4  |-  ( y  e.  ZZ  ->  ( -u y  e.  NN0  \/  y  e.  NN )
)
12 zindd.1 . . . . . . . 8  |-  ( x  =  0  ->  ( ph 
<->  ps ) )
1312imbi2d 229 . . . . . . 7  |-  ( x  =  0  ->  (
( ze  ->  ph )  <->  ( ze  ->  ps )
) )
14 zindd.2 . . . . . . . 8  |-  ( x  =  y  ->  ( ph 
<->  ch ) )
1514imbi2d 229 . . . . . . 7  |-  ( x  =  y  ->  (
( ze  ->  ph )  <->  ( ze  ->  ch )
) )
16 zindd.3 . . . . . . . 8  |-  ( x  =  ( y  +  1 )  ->  ( ph 
<->  ta ) )
1716imbi2d 229 . . . . . . 7  |-  ( x  =  ( y  +  1 )  ->  (
( ze  ->  ph )  <->  ( ze  ->  ta )
) )
18 zindd.4 . . . . . . . 8  |-  ( x  =  -u y  ->  ( ph 
<->  th ) )
1918imbi2d 229 . . . . . . 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 9133 . . . . . 6  |-  ( -u y  e.  NN0  ->  ( ze  ->  th ) )
2524com12 30 . . . . 5  |-  ( ze 
->  ( -u y  e. 
NN0  ->  th ) )
26 nnnn0 8952 . . . . . . . 8  |-  ( y  e.  NN  ->  y  e.  NN0 )
2713, 15, 17, 15, 20, 23nn0ind 9133 . . . . . . . 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 691 . . . 4  |-  ( ze 
->  ( ( -u y  e.  NN0  \/  y  e.  NN )  ->  th )
)
3311, 32syl5 32 . . 3  |-  ( ze 
->  ( y  e.  ZZ  ->  th ) )
3433ralrimiv 2481 . 2  |-  ( ze 
->  A. y  e.  ZZ  th )
35 znegcl 9053 . . . . 5  |-  ( x  e.  ZZ  ->  -u x  e.  ZZ )
36 negeq 7923 . . . . . . . . 9  |-  ( y  =  -u x  ->  -u y  =  -u -u x )
37 zcn 9027 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  e.  CC )
3837negnegd 8032 . . . . . . . . 9  |-  ( x  e.  ZZ  ->  -u -u x  =  x )
3936, 38sylan9eqr 2172 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  -u y  =  x )
4039eqcomd 2123 . . . . . . 7  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  x  =  -u y )
4140, 18syl 14 . . . . . 6  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  ( ph  <->  th )
)
4241bicomd 140 . . . . 5  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  ( th  <->  ph ) )
4335, 42rspcdv 2766 . . . 4  |-  ( x  e.  ZZ  ->  ( A. y  e.  ZZ  th 
->  ph ) )
4443com12 30 . . 3  |-  ( A. y  e.  ZZ  th  ->  ( x  e.  ZZ  ->  ph ) )
4544ralrimiv 2481 . 2  |-  ( A. y  e.  ZZ  th  ->  A. x  e.  ZZ  ph )
46 zindd.5 . . 3  |-  ( x  =  A  ->  ( ph 
<->  et ) )
4746rspccv 2760 . 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 103    <-> wb 104    \/ wo 682    = wceq 1316    e. wcel 1465   A.wral 2393  (class class class)co 5742   RRcr 7587   0cc0 7588   1c1 7589    + caddc 7591   -ucneg 7902   NNcn 8688   NN0cn0 8945   ZZcz 9022
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 588  ax-in2 589  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101  ax-un 4325  ax-setind 4422  ax-cnex 7679  ax-resscn 7680  ax-1cn 7681  ax-1re 7682  ax-icn 7683  ax-addcl 7684  ax-addrcl 7685  ax-mulcl 7686  ax-addcom 7688  ax-addass 7690  ax-distr 7692  ax-i2m1 7693  ax-0lt1 7694  ax-0id 7696  ax-rnegex 7697  ax-cnre 7699  ax-pre-ltirr 7700  ax-pre-ltwlin 7701  ax-pre-lttrn 7702  ax-pre-ltadd 7704
This theorem depends on definitions:  df-bi 116  df-3or 948  df-3an 949  df-tru 1319  df-fal 1322  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ne 2286  df-nel 2381  df-ral 2398  df-rex 2399  df-reu 2400  df-rab 2402  df-v 2662  df-sbc 2883  df-dif 3043  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-int 3742  df-br 3900  df-opab 3960  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-iota 5058  df-fun 5095  df-fv 5101  df-riota 5698  df-ov 5745  df-oprab 5746  df-mpo 5747  df-pnf 7770  df-mnf 7771  df-xr 7772  df-ltxr 7773  df-le 7774  df-sub 7903  df-neg 7904  df-inn 8689  df-n0 8946  df-z 9023
This theorem is referenced by:  efexp  11315
  Copyright terms: Public domain W3C validator