| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zeo2 | GIF version | ||
| Description: An integer is even or odd but not both. (Contributed by Mario Carneiro, 12-Sep-2015.) |
| Ref | Expression |
|---|---|
| zeo2 | ⊢ (𝑁 ∈ ℤ → ((𝑁 / 2) ∈ ℤ ↔ ¬ ((𝑁 + 1) / 2) ∈ ℤ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zcn 9484 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 2 | peano2cn 8314 | . . . . . 6 ⊢ (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ) | |
| 3 | 1, 2 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℂ) |
| 4 | 2cnd 9216 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℂ) | |
| 5 | 2ap0 9236 | . . . . . 6 ⊢ 2 # 0 | |
| 6 | 5 | a1i 9 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 2 # 0) |
| 7 | 3, 4, 6 | divcanap2d 8972 | . . . 4 ⊢ (𝑁 ∈ ℤ → (2 · ((𝑁 + 1) / 2)) = (𝑁 + 1)) |
| 8 | 1, 4, 6 | divcanap2d 8972 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (2 · (𝑁 / 2)) = 𝑁) |
| 9 | 8 | oveq1d 6033 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((2 · (𝑁 / 2)) + 1) = (𝑁 + 1)) |
| 10 | 7, 9 | eqtr4d 2267 | . . 3 ⊢ (𝑁 ∈ ℤ → (2 · ((𝑁 + 1) / 2)) = ((2 · (𝑁 / 2)) + 1)) |
| 11 | zneo 9581 | . . . . 5 ⊢ ((((𝑁 + 1) / 2) ∈ ℤ ∧ (𝑁 / 2) ∈ ℤ) → (2 · ((𝑁 + 1) / 2)) ≠ ((2 · (𝑁 / 2)) + 1)) | |
| 12 | 11 | expcom 116 | . . . 4 ⊢ ((𝑁 / 2) ∈ ℤ → (((𝑁 + 1) / 2) ∈ ℤ → (2 · ((𝑁 + 1) / 2)) ≠ ((2 · (𝑁 / 2)) + 1))) |
| 13 | 12 | necon2bd 2460 | . . 3 ⊢ ((𝑁 / 2) ∈ ℤ → ((2 · ((𝑁 + 1) / 2)) = ((2 · (𝑁 / 2)) + 1) → ¬ ((𝑁 + 1) / 2) ∈ ℤ)) |
| 14 | 10, 13 | syl5com 29 | . 2 ⊢ (𝑁 ∈ ℤ → ((𝑁 / 2) ∈ ℤ → ¬ ((𝑁 + 1) / 2) ∈ ℤ)) |
| 15 | zeo 9585 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((𝑁 / 2) ∈ ℤ ∨ ((𝑁 + 1) / 2) ∈ ℤ)) | |
| 16 | 15 | orcomd 736 | . . 3 ⊢ (𝑁 ∈ ℤ → (((𝑁 + 1) / 2) ∈ ℤ ∨ (𝑁 / 2) ∈ ℤ)) |
| 17 | 16 | ord 731 | . 2 ⊢ (𝑁 ∈ ℤ → (¬ ((𝑁 + 1) / 2) ∈ ℤ → (𝑁 / 2) ∈ ℤ)) |
| 18 | 14, 17 | impbid 129 | 1 ⊢ (𝑁 ∈ ℤ → ((𝑁 / 2) ∈ ℤ ↔ ¬ ((𝑁 + 1) / 2) ∈ ℤ)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 class class class wbr 4088 (class class class)co 6018 ℂcc 8030 0cc0 8032 1c1 8033 + caddc 8035 · cmul 8037 # cap 8761 / cdiv 8852 2c2 9194 ℤcz 9479 |
| 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 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 |
| 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 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-n0 9403 df-z 9480 |
| This theorem is referenced by: zesq 10921 zeo3 12431 |
| Copyright terms: Public domain | W3C validator |