| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > oddp1even | GIF version | ||
| Description: An integer is odd iff its successor is even. (Contributed by Mario Carneiro, 5-Sep-2016.) |
| Ref | Expression |
|---|---|
| oddp1even | ⊢ (𝑁 ∈ ℤ → (¬ 2 ∥ 𝑁 ↔ 2 ∥ (𝑁 + 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oddm1even 12499 | . 2 ⊢ (𝑁 ∈ ℤ → (¬ 2 ∥ 𝑁 ↔ 2 ∥ (𝑁 − 1))) | |
| 2 | 2z 9551 | . . 3 ⊢ 2 ∈ ℤ | |
| 3 | peano2zm 9561 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 4 | dvdsadd 12460 | . . 3 ⊢ ((2 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → (2 ∥ (𝑁 − 1) ↔ 2 ∥ (2 + (𝑁 − 1)))) | |
| 5 | 2, 3, 4 | sylancr 414 | . 2 ⊢ (𝑁 ∈ ℤ → (2 ∥ (𝑁 − 1) ↔ 2 ∥ (2 + (𝑁 − 1)))) |
| 6 | 2cnd 9258 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℂ) | |
| 7 | zcn 9528 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 8 | 1cnd 8238 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 1 ∈ ℂ) | |
| 9 | 6, 7, 8 | addsub12d 8555 | . . . 4 ⊢ (𝑁 ∈ ℤ → (2 + (𝑁 − 1)) = (𝑁 + (2 − 1))) |
| 10 | 2m1e1 9303 | . . . . 5 ⊢ (2 − 1) = 1 | |
| 11 | 10 | oveq2i 6039 | . . . 4 ⊢ (𝑁 + (2 − 1)) = (𝑁 + 1) |
| 12 | 9, 11 | eqtrdi 2280 | . . 3 ⊢ (𝑁 ∈ ℤ → (2 + (𝑁 − 1)) = (𝑁 + 1)) |
| 13 | 12 | breq2d 4105 | . 2 ⊢ (𝑁 ∈ ℤ → (2 ∥ (2 + (𝑁 − 1)) ↔ 2 ∥ (𝑁 + 1))) |
| 14 | 1, 5, 13 | 3bitrd 214 | 1 ⊢ (𝑁 ∈ ℤ → (¬ 2 ∥ 𝑁 ↔ 2 ∥ (𝑁 + 1))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 ∈ wcel 2202 class class class wbr 4093 (class class class)co 6028 1c1 8076 + caddc 8078 − cmin 8392 2c2 9236 ℤcz 9523 ∥ cdvds 12411 |
| 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 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-xor 1421 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 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-n0 9445 df-z 9524 df-dvds 12412 |
| This theorem is referenced by: zeo5 12512 oddp1d2 12514 n2dvdsm1 12537 2sqpwodd 12811 oddennn 13076 |
| Copyright terms: Public domain | W3C validator |