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

Theorem zindd 9309
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 9222 . . . . . . 7  |-  ( y  e.  ZZ  ->  -u y  e.  ZZ )
2 elznn0nn 9205 . . . . . . 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 751 . . . . . 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 9196 . . . . . . . 8  |-  ( y  e.  ZZ  ->  y  e.  CC )
87negnegd 8200 . . . . . . 7  |-  ( y  e.  ZZ  ->  -u -u y  =  y )
98eleq1d 2235 . . . . . 6  |-  ( y  e.  ZZ  ->  ( -u -u y  e.  NN  <->  y  e.  NN ) )
109orbi2d 780 . . . . 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 9305 . . . . . 6  |-  ( -u y  e.  NN0  ->  ( ze  ->  th ) )
2524com12 30 . . . . 5  |-  ( ze 
->  ( -u y  e. 
NN0  ->  th ) )
26 nnnn0 9121 . . . . . . . 8  |-  ( y  e.  NN  ->  y  e.  NN0 )
2713, 15, 17, 15, 20, 23nn0ind 9305 . . . . . . . 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 707 . . . 4  |-  ( ze 
->  ( ( -u y  e.  NN0  \/  y  e.  NN )  ->  th )
)
3311, 32syl5 32 . . 3  |-  ( ze 
->  ( y  e.  ZZ  ->  th ) )
3433ralrimiv 2538 . 2  |-  ( ze 
->  A. y  e.  ZZ  th )
35 znegcl 9222 . . . . 5  |-  ( x  e.  ZZ  ->  -u x  e.  ZZ )
36 negeq 8091 . . . . . . . . 9  |-  ( y  =  -u x  ->  -u y  =  -u -u x )
37 zcn 9196 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  e.  CC )
3837negnegd 8200 . . . . . . . . 9  |-  ( x  e.  ZZ  ->  -u -u x  =  x )
3936, 38sylan9eqr 2221 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  y  =  -u x )  ->  -u y  =  x )
4039eqcomd 2171 . . . . . . 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 2833 . . . 4  |-  ( x  e.  ZZ  ->  ( A. y  e.  ZZ  th 
->  ph ) )
4443com12 30 . . 3  |-  ( A. y  e.  ZZ  th  ->  ( x  e.  ZZ  ->  ph ) )
4544ralrimiv 2538 . 2  |-  ( A. y  e.  ZZ  th  ->  A. x  e.  ZZ  ph )
46 zindd.5 . . 3  |-  ( x  =  A  ->  ( ph 
<->  et ) )
4746rspccv 2827 . 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 698    = wceq 1343    e. wcel 2136   A.wral 2444  (class class class)co 5842   RRcr 7752   0cc0 7753   1c1 7754    + caddc 7756   -ucneg 8070   NNcn 8857   NN0cn0 9114   ZZcz 9191
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-addass 7855  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-ltadd 7869
This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-inn 8858  df-n0 9115  df-z 9192
This theorem is referenced by:  efexp  11623  pcexp  12241
  Copyright terms: Public domain W3C validator