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

Theorem nzadd 9378
Description: The sum of a real number not being an integer and an integer is not an integer. Note that "not being an integer" in this case means "the negation of is an integer" rather than "is apart from any integer" (given excluded middle, those two would be equivalent). (Contributed by AV, 19-Jul-2021.)
Assertion
Ref Expression
nzadd  |-  ( ( A  e.  ( RR 
\  ZZ )  /\  B  e.  ZZ )  ->  ( A  +  B
)  e.  ( RR 
\  ZZ ) )

Proof of Theorem nzadd
StepHypRef Expression
1 eldif 3166 . . 3  |-  ( A  e.  ( RR  \  ZZ )  <->  ( A  e.  RR  /\  -.  A  e.  ZZ ) )
2 zre 9330 . . . . . 6  |-  ( B  e.  ZZ  ->  B  e.  RR )
3 readdcl 8005 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  +  B
)  e.  RR )
42, 3sylan2 286 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  ZZ )  ->  ( A  +  B
)  e.  RR )
54adantlr 477 . . . 4  |-  ( ( ( A  e.  RR  /\ 
-.  A  e.  ZZ )  /\  B  e.  ZZ )  ->  ( A  +  B )  e.  RR )
6 zsubcl 9367 . . . . . . . . . . 11  |-  ( ( ( A  +  B
)  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( A  +  B )  -  B
)  e.  ZZ )
76expcom 116 . . . . . . . . . 10  |-  ( B  e.  ZZ  ->  (
( A  +  B
)  e.  ZZ  ->  ( ( A  +  B
)  -  B )  e.  ZZ ) )
87adantl 277 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  B  e.  ZZ )  ->  ( ( A  +  B )  e.  ZZ  ->  ( ( A  +  B )  -  B
)  e.  ZZ ) )
9 recn 8012 . . . . . . . . . . 11  |-  ( A  e.  RR  ->  A  e.  CC )
10 zcn 9331 . . . . . . . . . . 11  |-  ( B  e.  ZZ  ->  B  e.  CC )
11 pncan 8232 . . . . . . . . . . 11  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  B )  -  B
)  =  A )
129, 10, 11syl2an 289 . . . . . . . . . 10  |-  ( ( A  e.  RR  /\  B  e.  ZZ )  ->  ( ( A  +  B )  -  B
)  =  A )
1312eleq1d 2265 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  B  e.  ZZ )  ->  ( ( ( A  +  B )  -  B )  e.  ZZ  <->  A  e.  ZZ ) )
148, 13sylibd 149 . . . . . . . 8  |-  ( ( A  e.  RR  /\  B  e.  ZZ )  ->  ( ( A  +  B )  e.  ZZ  ->  A  e.  ZZ ) )
1514con3d 632 . . . . . . 7  |-  ( ( A  e.  RR  /\  B  e.  ZZ )  ->  ( -.  A  e.  ZZ  ->  -.  ( A  +  B )  e.  ZZ ) )
1615ex 115 . . . . . 6  |-  ( A  e.  RR  ->  ( B  e.  ZZ  ->  ( -.  A  e.  ZZ  ->  -.  ( A  +  B )  e.  ZZ ) ) )
1716com23 78 . . . . 5  |-  ( A  e.  RR  ->  ( -.  A  e.  ZZ  ->  ( B  e.  ZZ  ->  -.  ( A  +  B )  e.  ZZ ) ) )
1817imp31 256 . . . 4  |-  ( ( ( A  e.  RR  /\ 
-.  A  e.  ZZ )  /\  B  e.  ZZ )  ->  -.  ( A  +  B )  e.  ZZ )
195, 18jca 306 . . 3  |-  ( ( ( A  e.  RR  /\ 
-.  A  e.  ZZ )  /\  B  e.  ZZ )  ->  ( ( A  +  B )  e.  RR  /\  -.  ( A  +  B )  e.  ZZ ) )
201, 19sylanb 284 . 2  |-  ( ( A  e.  ( RR 
\  ZZ )  /\  B  e.  ZZ )  ->  ( ( A  +  B )  e.  RR  /\ 
-.  ( A  +  B )  e.  ZZ ) )
21 eldif 3166 . 2  |-  ( ( A  +  B )  e.  ( RR  \  ZZ )  <->  ( ( A  +  B )  e.  RR  /\  -.  ( A  +  B )  e.  ZZ ) )
2220, 21sylibr 134 1  |-  ( ( A  e.  ( RR 
\  ZZ )  /\  B  e.  ZZ )  ->  ( A  +  B
)  e.  ( RR 
\  ZZ ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167    \ cdif 3154  (class class class)co 5922   CCcc 7877   RRcr 7878    + caddc 7882    - cmin 8197   ZZcz 9326
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-ltadd 7995
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-inn 8991  df-n0 9250  df-z 9327
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator