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

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

Proof of Theorem zaddcllemneg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp2 1029 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  RR  /\  -u N  e.  NN )  ->  N  e.  RR )
21recnd 8354 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  RR  /\  -u N  e.  NN )  ->  N  e.  CC )
32negnegd 8628 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  RR  /\  -u N  e.  NN )  ->  -u -u N  =  N )
43oveq2d 6101 . 2  |-  ( ( M  e.  ZZ  /\  N  e.  RR  /\  -u N  e.  NN )  ->  ( M  +  -u -u N
)  =  ( M  +  N ) )
5 negeq 8519 . . . . . . . 8  |-  ( x  =  1  ->  -u x  =  -u 1 )
65oveq2d 6101 . . . . . . 7  |-  ( x  =  1  ->  ( M  +  -u x )  =  ( M  +  -u 1 ) )
76eleq1d 2307 . . . . . 6  |-  ( x  =  1  ->  (
( M  +  -u x )  e.  ZZ  <->  ( M  +  -u 1
)  e.  ZZ ) )
87imbi2d 230 . . . . 5  |-  ( x  =  1  ->  (
( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u x )  e.  ZZ )  <->  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u 1 )  e.  ZZ ) ) )
9 negeq 8519 . . . . . . . 8  |-  ( x  =  y  ->  -u x  =  -u y )
109oveq2d 6101 . . . . . . 7  |-  ( x  =  y  ->  ( M  +  -u x )  =  ( M  +  -u y ) )
1110eleq1d 2307 . . . . . 6  |-  ( x  =  y  ->  (
( M  +  -u x )  e.  ZZ  <->  ( M  +  -u y
)  e.  ZZ ) )
1211imbi2d 230 . . . . 5  |-  ( x  =  y  ->  (
( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u x )  e.  ZZ )  <->  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u y )  e.  ZZ ) ) )
13 negeq 8519 . . . . . . . 8  |-  ( x  =  ( y  +  1 )  ->  -u x  =  -u ( y  +  1 ) )
1413oveq2d 6101 . . . . . . 7  |-  ( x  =  ( y  +  1 )  ->  ( M  +  -u x )  =  ( M  +  -u ( y  +  1 ) ) )
1514eleq1d 2307 . . . . . 6  |-  ( x  =  ( y  +  1 )  ->  (
( M  +  -u x )  e.  ZZ  <->  ( M  +  -u (
y  +  1 ) )  e.  ZZ ) )
1615imbi2d 230 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  (
( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u x )  e.  ZZ )  <->  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u ( y  +  1 ) )  e.  ZZ ) ) )
17 negeq 8519 . . . . . . . 8  |-  ( x  =  -u N  ->  -u x  =  -u -u N )
1817oveq2d 6101 . . . . . . 7  |-  ( x  =  -u N  ->  ( M  +  -u x )  =  ( M  +  -u -u N ) )
1918eleq1d 2307 . . . . . 6  |-  ( x  =  -u N  ->  (
( M  +  -u x )  e.  ZZ  <->  ( M  +  -u -u N
)  e.  ZZ ) )
2019imbi2d 230 . . . . 5  |-  ( x  =  -u N  ->  (
( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u x )  e.  ZZ )  <->  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u -u N
)  e.  ZZ ) ) )
21 zcn 9649 . . . . . . . 8  |-  ( M  e.  ZZ  ->  M  e.  CC )
2221adantr 276 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  M  e.  CC )
23 1cnd 8342 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  1  e.  CC )
2422, 23negsubd 8643 . . . . . 6  |-  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u
1 )  =  ( M  -  1 ) )
25 peano2zm 9682 . . . . . . 7  |-  ( M  e.  ZZ  ->  ( M  -  1 )  e.  ZZ )
2625adantr 276 . . . . . 6  |-  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  -  1 )  e.  ZZ )
2724, 26eqeltrd 2315 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u
1 )  e.  ZZ )
28 nncn 9312 . . . . . . . . . . 11  |-  ( y  e.  NN  ->  y  e.  CC )
2928ad2antrr 492 . . . . . . . . . 10  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  y  e.  CC )
30 1cnd 8342 . . . . . . . . . 10  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  1  e.  CC )
3129, 30negdi2d 8651 . . . . . . . . 9  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  -u (
y  +  1 )  =  ( -u y  -  1 ) )
3231oveq2d 6101 . . . . . . . 8  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  ( M  +  -u ( y  +  1 ) )  =  ( M  +  ( -u y  -  1 ) ) )
3322ad2antlr 493 . . . . . . . . . 10  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  M  e.  CC )
3429negcld 8624 . . . . . . . . . 10  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  -u y  e.  CC )
3533, 34, 30addsubassd 8657 . . . . . . . . 9  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  (
( M  +  -u y )  -  1 )  =  ( M  +  ( -u y  -  1 ) ) )
36 peano2zm 9682 . . . . . . . . . 10  |-  ( ( M  +  -u y
)  e.  ZZ  ->  ( ( M  +  -u y )  -  1 )  e.  ZZ )
3736adantl 277 . . . . . . . . 9  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  (
( M  +  -u y )  -  1 )  e.  ZZ )
3835, 37eqeltrrd 2316 . . . . . . . 8  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  ( M  +  ( -u y  -  1 ) )  e.  ZZ )
3932, 38eqeltrd 2315 . . . . . . 7  |-  ( ( ( y  e.  NN  /\  ( M  e.  ZZ  /\  N  e.  RR ) )  /\  ( M  +  -u y )  e.  ZZ )  ->  ( M  +  -u ( y  +  1 ) )  e.  ZZ )
4039exp31 364 . . . . . 6  |-  ( y  e.  NN  ->  (
( M  e.  ZZ  /\  N  e.  RR )  ->  ( ( M  +  -u y )  e.  ZZ  ->  ( M  +  -u ( y  +  1 ) )  e.  ZZ ) ) )
4140a2d 26 . . . . 5  |-  ( y  e.  NN  ->  (
( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u y )  e.  ZZ )  -> 
( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u ( y  +  1 ) )  e.  ZZ ) ) )
428, 12, 16, 20, 27, 41nnind 9320 . . . 4  |-  ( -u N  e.  NN  ->  ( ( M  e.  ZZ  /\  N  e.  RR )  ->  ( M  +  -u -u N )  e.  ZZ ) )
4342impcom 125 . . 3  |-  ( ( ( M  e.  ZZ  /\  N  e.  RR )  /\  -u N  e.  NN )  ->  ( M  +  -u -u N )  e.  ZZ )
44433impa 1225 . 2  |-  ( ( M  e.  ZZ  /\  N  e.  RR  /\  -u N  e.  NN )  ->  ( M  +  -u -u N
)  e.  ZZ )
454, 44eqeltrrd 2316 1  |-  ( ( M  e.  ZZ  /\  N  e.  RR  /\  -u N  e.  NN )  ->  ( M  +  N )  e.  ZZ )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209  (class class class)co 6085   CCcc 8177   RRcr 8178   1c1 8180    + caddc 8182    - cmin 8497   -ucneg 8498   NNcn 9304   ZZcz 9644
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645
This theorem is used by:  zaddcl  9684
  Copyright terms: Public domain W3C validator