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

Theorem zaddcllempos 9319
Description: Lemma for zaddcl 9322. 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 5903 . . . . 5  |-  ( x  =  1  ->  ( M  +  x )  =  ( M  + 
1 ) )
21eleq1d 2258 . . . 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 5903 . . . . 5  |-  ( x  =  y  ->  ( M  +  x )  =  ( M  +  y ) )
54eleq1d 2258 . . . 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 5903 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( M  +  x )  =  ( M  +  ( y  +  1 ) ) )
87eleq1d 2258 . . . 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 5903 . . . . 5  |-  ( x  =  N  ->  ( M  +  x )  =  ( M  +  N ) )
1110eleq1d 2258 . . . 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 9318 . . 3  |-  ( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ )
14 peano2z 9318 . . . . . 6  |-  ( ( M  +  y )  e.  ZZ  ->  (
( M  +  y )  +  1 )  e.  ZZ )
15 zcn 9287 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  M  e.  CC )
1615adantl 277 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  M  e.  CC )
17 nncn 8956 . . . . . . . . 9  |-  ( y  e.  NN  ->  y  e.  CC )
1817adantr 276 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  y  e.  CC )
19 1cnd 8002 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  1  e.  CC )
2016, 18, 19addassd 8009 . . . . . . 7  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  +  1 )  =  ( M  +  ( y  +  1 ) ) )
2120eleq1d 2258 . . . . . 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 8964 . 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 1364    e. wcel 2160  (class class class)co 5895   CCcc 7838   1c1 7841    + caddc 7843   NNcn 8948   ZZcz 9282
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-setind 4554  ax-cnex 7931  ax-resscn 7932  ax-1cn 7933  ax-1re 7934  ax-icn 7935  ax-addcl 7936  ax-addrcl 7937  ax-mulcl 7938  ax-addcom 7940  ax-addass 7942  ax-distr 7944  ax-i2m1 7945  ax-0id 7948  ax-rnegex 7949  ax-cnre 7951
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-br 4019  df-opab 4080  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-iota 5196  df-fun 5237  df-fv 5243  df-riota 5851  df-ov 5898  df-oprab 5899  df-mpo 5900  df-sub 8159  df-neg 8160  df-inn 8949  df-n0 9206  df-z 9283
This theorem is referenced by:  zaddcl  9322
  Copyright terms: Public domain W3C validator