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

Theorem zaddcllempos 9209
Description: Lemma for zaddcl 9212. 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 5834 . . . . 5  |-  ( x  =  1  ->  ( M  +  x )  =  ( M  + 
1 ) )
21eleq1d 2226 . . . 4  |-  ( x  =  1  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  1 )  e.  ZZ ) )
32imbi2d 229 . . 3  |-  ( x  =  1  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ ) ) )
4 oveq2 5834 . . . . 5  |-  ( x  =  y  ->  ( M  +  x )  =  ( M  +  y ) )
54eleq1d 2226 . . . 4  |-  ( x  =  y  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  y )  e.  ZZ ) )
65imbi2d 229 . . 3  |-  ( x  =  y  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  y )  e.  ZZ ) ) )
7 oveq2 5834 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( M  +  x )  =  ( M  +  ( y  +  1 ) ) )
87eleq1d 2226 . . . 4  |-  ( x  =  ( y  +  1 )  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  ( y  +  1 ) )  e.  ZZ ) )
98imbi2d 229 . . 3  |-  ( x  =  ( y  +  1 )  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  ( y  +  1 ) )  e.  ZZ ) ) )
10 oveq2 5834 . . . . 5  |-  ( x  =  N  ->  ( M  +  x )  =  ( M  +  N ) )
1110eleq1d 2226 . . . 4  |-  ( x  =  N  ->  (
( M  +  x
)  e.  ZZ  <->  ( M  +  N )  e.  ZZ ) )
1211imbi2d 229 . . 3  |-  ( x  =  N  ->  (
( M  e.  ZZ  ->  ( M  +  x
)  e.  ZZ )  <-> 
( M  e.  ZZ  ->  ( M  +  N
)  e.  ZZ ) ) )
13 peano2z 9208 . . 3  |-  ( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ )
14 peano2z 9208 . . . . . 6  |-  ( ( M  +  y )  e.  ZZ  ->  (
( M  +  y )  +  1 )  e.  ZZ )
15 zcn 9177 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  M  e.  CC )
1615adantl 275 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  M  e.  CC )
17 nncn 8846 . . . . . . . . 9  |-  ( y  e.  NN  ->  y  e.  CC )
1817adantr 274 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  y  e.  CC )
19 1cnd 7896 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  1  e.  CC )
2016, 18, 19addassd 7902 . . . . . . 7  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  +  1 )  =  ( M  +  ( y  +  1 ) ) )
2120eleq1d 2226 . . . . . 6  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( ( M  +  y )  +  1 )  e.  ZZ  <->  ( M  +  ( y  +  1 ) )  e.  ZZ ) )
2214, 21syl5ib 153 . . . . 5  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  e.  ZZ  ->  ( M  +  ( y  +  1 ) )  e.  ZZ ) )
2322ex 114 . . . 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 8854 . 2  |-  ( N  e.  NN  ->  ( M  e.  ZZ  ->  ( M  +  N )  e.  ZZ ) )
2625impcom 124 1  |-  ( ( M  e.  ZZ  /\  N  e.  NN )  ->  ( M  +  N
)  e.  ZZ )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1335    e. wcel 2128  (class class class)co 5826   CCcc 7732   1c1 7735    + caddc 7737   NNcn 8838   ZZcz 9172
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 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-14 2131  ax-ext 2139  ax-sep 4084  ax-pow 4137  ax-pr 4171  ax-setind 4498  ax-cnex 7825  ax-resscn 7826  ax-1cn 7827  ax-1re 7828  ax-icn 7829  ax-addcl 7830  ax-addrcl 7831  ax-mulcl 7832  ax-addcom 7834  ax-addass 7836  ax-distr 7838  ax-i2m1 7839  ax-0id 7842  ax-rnegex 7843  ax-cnre 7845
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-reu 2442  df-rab 2444  df-v 2714  df-sbc 2938  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-pw 3546  df-sn 3567  df-pr 3568  df-op 3570  df-uni 3775  df-int 3810  df-br 3968  df-opab 4028  df-id 4255  df-xp 4594  df-rel 4595  df-cnv 4596  df-co 4597  df-dm 4598  df-iota 5137  df-fun 5174  df-fv 5180  df-riota 5782  df-ov 5829  df-oprab 5830  df-mpo 5831  df-sub 8052  df-neg 8053  df-inn 8839  df-n0 9096  df-z 9173
This theorem is referenced by:  zaddcl  9212
  Copyright terms: Public domain W3C validator