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

Theorem zaddcllempos 9483
Description: Lemma for zaddcl 9486. 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 6009 . . . . 5  |-  ( x  =  1  ->  ( M  +  x )  =  ( M  + 
1 ) )
21eleq1d 2298 . . . 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 6009 . . . . 5  |-  ( x  =  y  ->  ( M  +  x )  =  ( M  +  y ) )
54eleq1d 2298 . . . 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 6009 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( M  +  x )  =  ( M  +  ( y  +  1 ) ) )
87eleq1d 2298 . . . 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 6009 . . . . 5  |-  ( x  =  N  ->  ( M  +  x )  =  ( M  +  N ) )
1110eleq1d 2298 . . . 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 9482 . . 3  |-  ( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ )
14 peano2z 9482 . . . . . 6  |-  ( ( M  +  y )  e.  ZZ  ->  (
( M  +  y )  +  1 )  e.  ZZ )
15 zcn 9451 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  M  e.  CC )
1615adantl 277 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  M  e.  CC )
17 nncn 9118 . . . . . . . . 9  |-  ( y  e.  NN  ->  y  e.  CC )
1817adantr 276 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  y  e.  CC )
19 1cnd 8162 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  1  e.  CC )
2016, 18, 19addassd 8169 . . . . . . 7  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  +  1 )  =  ( M  +  ( y  +  1 ) ) )
2120eleq1d 2298 . . . . . 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 9126 . 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 1395    e. wcel 2200  (class class class)co 6001   CCcc 7997   1c1 8000    + caddc 8002   NNcn 9110   ZZcz 9446
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-sub 8319  df-neg 8320  df-inn 9111  df-n0 9370  df-z 9447
This theorem is referenced by:  zaddcl  9486  lswccatn0lsw  11146
  Copyright terms: Public domain W3C validator