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

Theorem zaddcllempos 9631
Description: Lemma for zaddcl 9634. 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 6066 . . . . 5  |-  ( x  =  1  ->  ( M  +  x )  =  ( M  + 
1 ) )
21eleq1d 2303 . . . 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 6066 . . . . 5  |-  ( x  =  y  ->  ( M  +  x )  =  ( M  +  y ) )
54eleq1d 2303 . . . 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 6066 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( M  +  x )  =  ( M  +  ( y  +  1 ) ) )
87eleq1d 2303 . . . 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 6066 . . . . 5  |-  ( x  =  N  ->  ( M  +  x )  =  ( M  +  N ) )
1110eleq1d 2303 . . . 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 9630 . . 3  |-  ( M  e.  ZZ  ->  ( M  +  1 )  e.  ZZ )
14 peano2z 9630 . . . . . 6  |-  ( ( M  +  y )  e.  ZZ  ->  (
( M  +  y )  +  1 )  e.  ZZ )
15 zcn 9599 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  M  e.  CC )
1615adantl 277 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  M  e.  CC )
17 nncn 9262 . . . . . . . . 9  |-  ( y  e.  NN  ->  y  e.  CC )
1817adantr 276 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  y  e.  CC )
19 1cnd 8306 . . . . . . . 8  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  1  e.  CC )
2016, 18, 19addassd 8312 . . . . . . 7  |-  ( ( y  e.  NN  /\  M  e.  ZZ )  ->  ( ( M  +  y )  +  1 )  =  ( M  +  ( y  +  1 ) ) )
2120eleq1d 2303 . . . . . 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 9270 . 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 1398    e. wcel 2205  (class class class)co 6058   CCcc 8141   1c1 8144    + caddc 8146   NNcn 9254   ZZcz 9594
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595
This theorem is referenced by:  zaddcl  9634  lswccatn0lsw  11324
  Copyright terms: Public domain W3C validator