| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zneo | Structured version Visualization version 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 12645 | . . 3 ⊢ ¬ (1 / 2) ∈ ℤ | |
| 2 | 2cn 12287 | . . . . . . 7 ⊢ 2 ∈ ℂ | |
| 3 | zcn 12567 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ) | |
| 4 | 3 | adantr 484 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℂ) |
| 5 | mulcl 11151 | . . . . . . 7 ⊢ ((2 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (2 · 𝐴) ∈ ℂ) | |
| 6 | 2, 4, 5 | sylancr 596 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐴) ∈ ℂ) |
| 7 | zcn 12567 | . . . . . . . 8 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ) | |
| 8 | 7 | adantl 485 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℂ) |
| 9 | mulcl 11151 | . . . . . . 7 ⊢ ((2 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · 𝐵) ∈ ℂ) | |
| 10 | 2, 8, 9 | sylancr 596 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐵) ∈ ℂ) |
| 11 | 1cnd 11169 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 1 ∈ ℂ) | |
| 12 | 6, 10, 11 | subaddd 11554 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) = 1 ↔ ((2 · 𝐵) + 1) = (2 · 𝐴))) |
| 13 | 2 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 2 ∈ ℂ) |
| 14 | 13, 4, 8 | subdid 11637 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · (𝐴 − 𝐵)) = ((2 · 𝐴) − (2 · 𝐵))) |
| 15 | 14 | oveq1d 7406 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((2 · (𝐴 − 𝐵)) / 2) = (((2 · 𝐴) − (2 · 𝐵)) / 2)) |
| 16 | zsubcl 12607 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) ∈ ℤ) | |
| 17 | zcn 12567 | . . . . . . . . . 10 ⊢ ((𝐴 − 𝐵) ∈ ℤ → (𝐴 − 𝐵) ∈ ℂ) | |
| 18 | 16, 17 | syl 17 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) ∈ ℂ) |
| 19 | 2ne0 12318 | . . . . . . . . . 10 ⊢ 2 ≠ 0 | |
| 20 | 19 | a1i 11 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 2 ≠ 0) |
| 21 | 18, 13, 20 | divcan3d 11966 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((2 · (𝐴 − 𝐵)) / 2) = (𝐴 − 𝐵)) |
| 22 | 15, 21 | eqtr3d 2798 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) / 2) = (𝐴 − 𝐵)) |
| 23 | 22, 16 | eqeltrd 2861 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) / 2) ∈ ℤ) |
| 24 | oveq1 7398 | . . . . . . 7 ⊢ (((2 · 𝐴) − (2 · 𝐵)) = 1 → (((2 · 𝐴) − (2 · 𝐵)) / 2) = (1 / 2)) | |
| 25 | 24 | eleq1d 2846 | . . . . . 6 ⊢ (((2 · 𝐴) − (2 · 𝐵)) = 1 → ((((2 · 𝐴) − (2 · 𝐵)) / 2) ∈ ℤ ↔ (1 / 2) ∈ ℤ)) |
| 26 | 23, 25 | syl5ibcom 247 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐴) − (2 · 𝐵)) = 1 → (1 / 2) ∈ ℤ)) |
| 27 | 12, 26 | sylbird 262 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((2 · 𝐵) + 1) = (2 · 𝐴) → (1 / 2) ∈ ℤ)) |
| 28 | 27 | necon3bd 2970 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (¬ (1 / 2) ∈ ℤ → ((2 · 𝐵) + 1) ≠ (2 · 𝐴))) |
| 29 | 1, 28 | mpi 20 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((2 · 𝐵) + 1) ≠ (2 · 𝐴)) |
| 30 | 29 | necomd 3011 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (2 · 𝐴) ≠ ((2 · 𝐵) + 1)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 (class class class)co 7391 ℂcc 11065 0cc0 11067 1c1 11068 + caddc 11070 · cmul 11072 − cmin 11408 / cdiv 11838 2c2 12266 ℤcz 12562 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-n0 12476 df-z 12563 |
| This theorem is referenced by: nneo 12651 zeo2 12654 smndex2dnrinv 18943 ablsimpgfindlem1 20140 |
| Copyright terms: Public domain | W3C validator |