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

Theorem zneo 9580
Description: No even integer equals an odd integer (i.e. no integer can be both even and odd). Exercise 10(a) of [Apostol] p. 28. (Contributed by NM, 31-Jul-2004.) (Proof shortened by Mario Carneiro, 18-May-2014.)
Assertion
Ref Expression
zneo  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( 2  x.  A
)  =/=  ( ( 2  x.  B )  +  1 ) )

Proof of Theorem zneo
StepHypRef Expression
1 halfnz 9575 . . 3  |-  -.  (
1  /  2 )  e.  ZZ
2 2cn 9213 . . . . . . 7  |-  2  e.  CC
3 zcn 9483 . . . . . . . 8  |-  ( A  e.  ZZ  ->  A  e.  CC )
43adantr 276 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  A  e.  CC )
5 mulcl 8158 . . . . . . 7  |-  ( ( 2  e.  CC  /\  A  e.  CC )  ->  ( 2  x.  A
)  e.  CC )
62, 4, 5sylancr 414 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( 2  x.  A
)  e.  CC )
7 zcn 9483 . . . . . . . 8  |-  ( B  e.  ZZ  ->  B  e.  CC )
87adantl 277 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  B  e.  CC )
9 mulcl 8158 . . . . . . 7  |-  ( ( 2  e.  CC  /\  B  e.  CC )  ->  ( 2  x.  B
)  e.  CC )
102, 8, 9sylancr 414 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( 2  x.  B
)  e.  CC )
11 1cnd 8194 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  1  e.  CC )
126, 10, 11subaddd 8507 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( 2  x.  A )  -  ( 2  x.  B
) )  =  1  <-> 
( ( 2  x.  B )  +  1 )  =  ( 2  x.  A ) ) )
132a1i 9 . . . . . . . . . 10  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  2  e.  CC )
1413, 4, 8subdid 8592 . . . . . . . . 9  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( 2  x.  ( A  -  B )
)  =  ( ( 2  x.  A )  -  ( 2  x.  B ) ) )
1514oveq1d 6032 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( 2  x.  ( A  -  B
) )  /  2
)  =  ( ( ( 2  x.  A
)  -  ( 2  x.  B ) )  /  2 ) )
16 zsubcl 9519 . . . . . . . . . 10  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  -  B
)  e.  ZZ )
17 zcn 9483 . . . . . . . . . 10  |-  ( ( A  -  B )  e.  ZZ  ->  ( A  -  B )  e.  CC )
1816, 17syl 14 . . . . . . . . 9  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  -  B
)  e.  CC )
19 2ap0 9235 . . . . . . . . . 10  |-  2 #  0
2019a1i 9 . . . . . . . . 9  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  2 #  0 )
2118, 13, 20divcanap3d 8974 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( 2  x.  ( A  -  B
) )  /  2
)  =  ( A  -  B ) )
2215, 21eqtr3d 2266 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( 2  x.  A )  -  ( 2  x.  B
) )  /  2
)  =  ( A  -  B ) )
2322, 16eqeltrd 2308 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( 2  x.  A )  -  ( 2  x.  B
) )  /  2
)  e.  ZZ )
24 oveq1 6024 . . . . . . 7  |-  ( ( ( 2  x.  A
)  -  ( 2  x.  B ) )  =  1  ->  (
( ( 2  x.  A )  -  (
2  x.  B ) )  /  2 )  =  ( 1  / 
2 ) )
2524eleq1d 2300 . . . . . 6  |-  ( ( ( 2  x.  A
)  -  ( 2  x.  B ) )  =  1  ->  (
( ( ( 2  x.  A )  -  ( 2  x.  B
) )  /  2
)  e.  ZZ  <->  ( 1  /  2 )  e.  ZZ ) )
2623, 25syl5ibcom 155 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( 2  x.  A )  -  ( 2  x.  B
) )  =  1  ->  ( 1  / 
2 )  e.  ZZ ) )
2712, 26sylbird 170 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( 2  x.  B )  +  1 )  =  ( 2  x.  A )  ->  ( 1  / 
2 )  e.  ZZ ) )
2827necon3bd 2445 . . 3  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( -.  ( 1  /  2 )  e.  ZZ  ->  ( (
2  x.  B )  +  1 )  =/=  ( 2  x.  A
) ) )
291, 28mpi 15 . 2  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( 2  x.  B )  +  1 )  =/=  ( 2  x.  A ) )
3029necomd 2488 1  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( 2  x.  A
)  =/=  ( ( 2  x.  B )  +  1 ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202    =/= wne 2402   class class class wbr 4088  (class class class)co 6017   CCcc 8029   0cc0 8031   1c1 8032    + caddc 8034    x. cmul 8036    - cmin 8349   # cap 8760    / cdiv 8851   2c2 9193   ZZcz 9478
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-n0 9402  df-z 9479
This theorem is referenced by:  nneo  9582  zeo2  9585
  Copyright terms: Public domain W3C validator