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

Theorem zaddcllempos 9290
Description: Lemma for zaddcl 9293. Special case in which  N is a positive integer. (Contributed by Jim Kingdon, 14-Mar-2020.)
Assertion
Ref Expression
zaddcllempos  |-  ( ( M  e.  ZZ  /\  N  e.  NN )  ->  ( M  +  N
)  e.  ZZ )

Proof of Theorem zaddcllempos
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 5883 . . . . 5  |-  ( x  =  1  ->  ( M  +  x )  =  ( M  + 
1 ) )
21eleq1d 2246 . . . 4  |-  ( x  =  1  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  1 )  e.  ZZ ) )
32imbi2d 230 . . 3  |-  ( x  =  1  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ ) ) )
4 oveq2 5883 . . . . 5  |-  ( x  =  y  ->  ( M  +  x )  =  ( M  +  y ) )
54eleq1d 2246 . . . 4  |-  ( x  =  y  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  y )  e.  ZZ ) )
65imbi2d 230 . . 3  |-  ( x  =  y  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  y )  e.  ZZ ) ) )
7 oveq2 5883 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( M  +  x )  =  ( M  +  ( y  +  1 ) ) )
87eleq1d 2246 . . . 4  |-  ( x  =  ( y  +  1 )  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  ( y  +  1 ) )  e.  ZZ ) )
98imbi2d 230 . . 3  |-  ( x  =  ( y  +  1 )  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  ( y  +  1 ) )  e.  ZZ ) ) )
10 oveq2 5883 . . . . 5  |-  ( x  =  N  ->  ( M  +  x )  =  ( M  +  N ) )
1110eleq1d 2246 . . . 4  |-  ( x  =  N  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  N )  e.  ZZ ) )
1211imbi2d 230 . . 3  |-  ( x  =  N  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  N
)  e.  ZZ ) ) )
13 peano2z 9289 . . 3  |-  ( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ )
14 peano2z 9289 . . . . . 6  |-  ( ( M  +  y )  e.  ZZ  ->  (
( M  +  y )  +  1 )  e.  ZZ )
15 zcn 9258 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  M  e.  CC )
1615adantl 277 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  M  e.  CC )
17 nncn 8927 . . . . . . . . 9  |-  ( y  e.  NN  ->  y  e.  CC )
1817adantr 276 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  y  e.  CC )
19 1cnd 7973 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  1  e.  CC )
2016, 18, 19addassd 7980 . . . . . . 7  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  +  1 )  =  ( M  +  ( y  +  1 ) ) )
2120eleq1d 2246 . . . . . 6  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( ( M  +  y )  +  1 )  e.  ZZ  <->  ( M  +  ( y  +  1 ) )  e.  ZZ ) )
2214, 21imbitrid 154 . . . . 5  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  e.  ZZ  ->  ( M  +  ( y  +  1 ) )  e.  ZZ ) )
2322ex 115 . . . 4  |-  ( y  e.  NN  ->  ( M  e.  ZZ  ->  ( ( M  +  y )  e.  ZZ  ->  ( M  +  ( y  +  1 ) )  e.  ZZ ) ) )
2423a2d 26 . . 3  |-  ( y  e.  NN  ->  (
( M  e.  ZZ  ->  ( M  +  y )  e.  ZZ )  ->  ( M  e.  ZZ  ->  ( M  +  ( y  +  1 ) )  e.  ZZ ) ) )
253, 6, 9, 12, 13, 24nnind 8935 . 2  |-  ( N  e.  NN  ->  ( M  e.  ZZ  ->  ( M  +  N )  e.  ZZ ) )
2625impcom 125 1  |-  ( ( M  e.  ZZ  /\  N  e.  NN )  ->  ( M  +  N
)  e.  ZZ )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2148  (class class class)co 5875   CCcc 7809   1c1 7812    + caddc 7814   NNcn 8919   ZZcz 9253
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-setind 4537  ax-cnex 7902  ax-resscn 7903  ax-1cn 7904  ax-1re 7905  ax-icn 7906  ax-addcl 7907  ax-addrcl 7908  ax-mulcl 7909  ax-addcom 7911  ax-addass 7913  ax-distr 7915  ax-i2m1 7916  ax-0id 7919  ax-rnegex 7920  ax-cnre 7922
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2740  df-sbc 2964  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-br 4005  df-opab 4066  df-id 4294  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-iota 5179  df-fun 5219  df-fv 5225  df-riota 5831  df-ov 5878  df-oprab 5879  df-mpo 5880  df-sub 8130  df-neg 8131  df-inn 8920  df-n0 9177  df-z 9254
This theorem is referenced by:  zaddcl  9293
  Copyright terms: Public domain W3C validator