| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nneo | GIF version | ||
| Description: A positive integer is even or odd but not both. (Contributed by NM, 1-Jan-2006.) (Proof shortened by Mario Carneiro, 18-May-2014.) |
| Ref | Expression |
|---|---|
| nneo | ⊢ (𝑁 ∈ ℕ → ((𝑁 / 2) ∈ ℕ ↔ ¬ ((𝑁 + 1) / 2) ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nncn 9291 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
| 2 | peano2cn 8451 | . . . . . 6 ⊢ (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ) | |
| 3 | 1, 2 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℂ) |
| 4 | 2cnd 9356 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℂ) | |
| 5 | 2ap0 9376 | . . . . . 6 ⊢ 2 # 0 | |
| 6 | 5 | a1i 9 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 2 # 0) |
| 7 | 3, 4, 6 | divcanap2d 9112 | . . . 4 ⊢ (𝑁 ∈ ℕ → (2 · ((𝑁 + 1) / 2)) = (𝑁 + 1)) |
| 8 | 1, 4, 6 | divcanap2d 9112 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (2 · (𝑁 / 2)) = 𝑁) |
| 9 | 8 | oveq1d 6090 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((2 · (𝑁 / 2)) + 1) = (𝑁 + 1)) |
| 10 | 7, 9 | eqtr4d 2274 | . . 3 ⊢ (𝑁 ∈ ℕ → (2 · ((𝑁 + 1) / 2)) = ((2 · (𝑁 / 2)) + 1)) |
| 11 | nnz 9642 | . . . . . 6 ⊢ (((𝑁 + 1) / 2) ∈ ℕ → ((𝑁 + 1) / 2) ∈ ℤ) | |
| 12 | nnz 9642 | . . . . . 6 ⊢ ((𝑁 / 2) ∈ ℕ → (𝑁 / 2) ∈ ℤ) | |
| 13 | zneo 9726 | . . . . . 6 ⊢ ((((𝑁 + 1) / 2) ∈ ℤ ∧ (𝑁 / 2) ∈ ℤ) → (2 · ((𝑁 + 1) / 2)) ≠ ((2 · (𝑁 / 2)) + 1)) | |
| 14 | 11, 12, 13 | syl2an 289 | . . . . 5 ⊢ ((((𝑁 + 1) / 2) ∈ ℕ ∧ (𝑁 / 2) ∈ ℕ) → (2 · ((𝑁 + 1) / 2)) ≠ ((2 · (𝑁 / 2)) + 1)) |
| 15 | 14 | expcom 116 | . . . 4 ⊢ ((𝑁 / 2) ∈ ℕ → (((𝑁 + 1) / 2) ∈ ℕ → (2 · ((𝑁 + 1) / 2)) ≠ ((2 · (𝑁 / 2)) + 1))) |
| 16 | 15 | necon2bd 2478 | . . 3 ⊢ ((𝑁 / 2) ∈ ℕ → ((2 · ((𝑁 + 1) / 2)) = ((2 · (𝑁 / 2)) + 1) → ¬ ((𝑁 + 1) / 2) ∈ ℕ)) |
| 17 | 10, 16 | syl5com 29 | . 2 ⊢ (𝑁 ∈ ℕ → ((𝑁 / 2) ∈ ℕ → ¬ ((𝑁 + 1) / 2) ∈ ℕ)) |
| 18 | nneoor 9727 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((𝑁 / 2) ∈ ℕ ∨ ((𝑁 + 1) / 2) ∈ ℕ)) | |
| 19 | 18 | orcomd 741 | . . 3 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) / 2) ∈ ℕ ∨ (𝑁 / 2) ∈ ℕ)) |
| 20 | 19 | ord 736 | . 2 ⊢ (𝑁 ∈ ℕ → (¬ ((𝑁 + 1) / 2) ∈ ℕ → (𝑁 / 2) ∈ ℕ)) |
| 21 | 17, 20 | impbid 129 | 1 ⊢ (𝑁 ∈ ℕ → ((𝑁 / 2) ∈ ℕ ↔ ¬ ((𝑁 + 1) / 2) ∈ ℕ)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 class class class wbr 4125 (class class class)co 6075 ℂcc 8167 0cc0 8169 1c1 8170 + caddc 8172 · cmul 8174 # cap 8899 / cdiv 8992 ℕcn 9283 2c2 9334 ℤcz 9623 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-id 4433 df-po 4436 df-iso 4437 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-2 9342 df-n0 9543 df-z 9624 |
| This theorem is referenced by: nneoi 9729 |
| Copyright terms: Public domain | W3C validator |