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

Theorem zneo 9642
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 9637 . . 3  |-  -.  (
1  /  2 )  e.  ZZ
2 2cn 9273 . . . . . . 7  |-  2  e.  CC
3 zcn 9545 . . . . . . . 8  |-  ( A  e.  ZZ  ->  A  e.  CC )
43adantr 276 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  A  e.  CC )
5 mulcl 8219 . . . . . . 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 9545 . . . . . . . 8  |-  ( B  e.  ZZ  ->  B  e.  CC )
87adantl 277 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  B  e.  CC )
9 mulcl 8219 . . . . . . 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 8255 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  1  e.  CC )
126, 10, 11subaddd 8567 . . . . 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 8652 . . . . . . . . 9  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( 2  x.  ( A  -  B )
)  =  ( ( 2  x.  A )  -  ( 2  x.  B ) ) )
1514oveq1d 6043 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( 2  x.  ( A  -  B
) )  /  2
)  =  ( ( ( 2  x.  A
)  -  ( 2  x.  B ) )  /  2 ) )
16 zsubcl 9581 . . . . . . . . . 10  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  -  B
)  e.  ZZ )
17 zcn 9545 . . . . . . . . . 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 9295 . . . . . . . . . 10  |-  2 #  0
2019a1i 9 . . . . . . . . 9  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  2 #  0 )
2118, 13, 20divcanap3d 9034 . . . . . . . 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 6035 . . . . . . 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 2446 . . 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 2489 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 1398    e. wcel 2202    =/= wne 2403   class class class wbr 4093  (class class class)co 6028   CCcc 8090   0cc0 8092   1c1 8093    + caddc 8095    x. cmul 8097    - cmin 8409   # cap 8820    / cdiv 8911   2c2 9253   ZZcz 9540
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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-n0 9462  df-z 9541
This theorem is referenced by:  nneo  9644  zeo2  9647
  Copyright terms: Public domain W3C validator