![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > zneo | GIF version |
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.) |
Ref | Expression |
---|---|
zneo | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐴) ≠ ((2 · 𝐵) + 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | halfnz 9416 | . . 3 ⊢ ¬ (1 / 2) ∈ ℤ | |
2 | 2cn 9055 | . . . . . . 7 ⊢ 2 ∈ ℂ | |
3 | zcn 9325 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ) | |
4 | 3 | adantr 276 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℂ) |
5 | mulcl 8001 | . . . . . . 7 ⊢ ((2 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (2 · 𝐴) ∈ ℂ) | |
6 | 2, 4, 5 | sylancr 414 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐴) ∈ ℂ) |
7 | zcn 9325 | . . . . . . . 8 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ) | |
8 | 7 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℂ) |
9 | mulcl 8001 | . . . . . . 7 ⊢ ((2 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · 𝐵) ∈ ℂ) | |
10 | 2, 8, 9 | sylancr 414 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐵) ∈ ℂ) |
11 | 1cnd 8037 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 1 ∈ ℂ) | |
12 | 6, 10, 11 | subaddd 8350 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) = 1 ↔ ((2 · 𝐵) + 1) = (2 · 𝐴))) |
13 | 2 | a1i 9 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 2 ∈ ℂ) |
14 | 13, 4, 8 | subdid 8435 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · (𝐴 − 𝐵)) = ((2 · 𝐴) − (2 · 𝐵))) |
15 | 14 | oveq1d 5934 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((2 · (𝐴 − 𝐵)) / 2) = (((2 · 𝐴) − (2 · 𝐵)) / 2)) |
16 | zsubcl 9361 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) ∈ ℤ) | |
17 | zcn 9325 | . . . . . . . . . 10 ⊢ ((𝐴 − 𝐵) ∈ ℤ → (𝐴 − 𝐵) ∈ ℂ) | |
18 | 16, 17 | syl 14 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) ∈ ℂ) |
19 | 2ap0 9077 | . . . . . . . . . 10 ⊢ 2 # 0 | |
20 | 19 | a1i 9 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 2 # 0) |
21 | 18, 13, 20 | divcanap3d 8816 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((2 · (𝐴 − 𝐵)) / 2) = (𝐴 − 𝐵)) |
22 | 15, 21 | eqtr3d 2228 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) / 2) = (𝐴 − 𝐵)) |
23 | 22, 16 | eqeltrd 2270 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) / 2) ∈ ℤ) |
24 | oveq1 5926 | . . . . . . 7 ⊢ (((2 · 𝐴) − (2 · 𝐵)) = 1 → (((2 · 𝐴) − (2 · 𝐵)) / 2) = (1 / 2)) | |
25 | 24 | eleq1d 2262 | . . . . . 6 ⊢ (((2 · 𝐴) − (2 · 𝐵)) = 1 → ((((2 · 𝐴) − (2 · 𝐵)) / 2) ∈ ℤ ↔ (1 / 2) ∈ ℤ)) |
26 | 23, 25 | syl5ibcom 155 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) = 1 → (1 / 2) ∈ ℤ)) |
27 | 12, 26 | sylbird 170 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐵) + 1) = (2 · 𝐴) → (1 / 2) ∈ ℤ)) |
28 | 27 | necon3bd 2407 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (¬ (1 / 2) ∈ ℤ → ((2 · 𝐵) + 1) ≠ (2 · 𝐴))) |
29 | 1, 28 | mpi 15 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((2 · 𝐵) + 1) ≠ (2 · 𝐴)) |
30 | 29 | necomd 2450 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐴) ≠ ((2 · 𝐵) + 1)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 class class class wbr 4030 (class class class)co 5919 ℂcc 7872 0cc0 7874 1c1 7875 + caddc 7877 · cmul 7879 − cmin 8192 # cap 8602 / cdiv 8693 2c2 9035 ℤcz 9320 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-br 4031 df-opab 4092 df-id 4325 df-po 4328 df-iso 4329 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-iota 5216 df-fun 5257 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-2 9043 df-n0 9244 df-z 9321 |
This theorem is referenced by: nneo 9423 zeo2 9426 |
Copyright terms: Public domain | W3C validator |