| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2tp1odd | Structured version Visualization version GIF version | ||
| Description: A number which is twice an integer increased by 1 is odd. (Contributed by AV, 16-Jul-2021.) |
| Ref | Expression |
|---|---|
| 2tp1odd | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 = ((2 · 𝐴) + 1)) → ¬ 2 ∥ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℤ) | |
| 2 | oveq2 7364 | . . . . . . . 8 ⊢ (𝑘 = 𝐴 → (2 · 𝑘) = (2 · 𝐴)) | |
| 3 | 2 | oveq1d 7371 | . . . . . . 7 ⊢ (𝑘 = 𝐴 → ((2 · 𝑘) + 1) = ((2 · 𝐴) + 1)) |
| 4 | 3 | eqeq1d 2741 | . . . . . 6 ⊢ (𝑘 = 𝐴 → (((2 · 𝑘) + 1) = ((2 · 𝐴) + 1) ↔ ((2 · 𝐴) + 1) = ((2 · 𝐴) + 1))) |
| 5 | 4 | adantl 482 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝑘 = 𝐴) → (((2 · 𝑘) + 1) = ((2 · 𝐴) + 1) ↔ ((2 · 𝐴) + 1) = ((2 · 𝐴) + 1))) |
| 6 | eqidd 2740 | . . . . 5 ⊢ (𝐴 ∈ ℤ → ((2 · 𝐴) + 1) = ((2 · 𝐴) + 1)) | |
| 7 | 1, 5, 6 | rspcedvd 3562 | . . . 4 ⊢ (𝐴 ∈ ℤ → ∃𝑘 ∈ ℤ ((2 · 𝑘) + 1) = ((2 · 𝐴) + 1)) |
| 8 | 2z 12550 | . . . . . . . 8 ⊢ 2 ∈ ℤ | |
| 9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → 2 ∈ ℤ) |
| 10 | 9, 1 | zmulcld 12630 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → (2 · 𝐴) ∈ ℤ) |
| 11 | 10 | peano2zd 12627 | . . . . 5 ⊢ (𝐴 ∈ ℤ → ((2 · 𝐴) + 1) ∈ ℤ) |
| 12 | odd2np1 16301 | . . . . 5 ⊢ (((2 · 𝐴) + 1) ∈ ℤ → (¬ 2 ∥ ((2 · 𝐴) + 1) ↔ ∃𝑘 ∈ ℤ ((2 · 𝑘) + 1) = ((2 · 𝐴) + 1))) | |
| 13 | 11, 12 | syl 17 | . . . 4 ⊢ (𝐴 ∈ ℤ → (¬ 2 ∥ ((2 · 𝐴) + 1) ↔ ∃𝑘 ∈ ℤ ((2 · 𝑘) + 1) = ((2 · 𝐴) + 1))) |
| 14 | 7, 13 | mpbird 258 | . . 3 ⊢ (𝐴 ∈ ℤ → ¬ 2 ∥ ((2 · 𝐴) + 1)) |
| 15 | 14 | adantr 481 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 = ((2 · 𝐴) + 1)) → ¬ 2 ∥ ((2 · 𝐴) + 1)) |
| 16 | breq2 5076 | . . 3 ⊢ (𝐵 = ((2 · 𝐴) + 1) → (2 ∥ 𝐵 ↔ 2 ∥ ((2 · 𝐴) + 1))) | |
| 17 | 16 | adantl 482 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 = ((2 · 𝐴) + 1)) → (2 ∥ 𝐵 ↔ 2 ∥ ((2 · 𝐴) + 1))) |
| 18 | 15, 17 | mtbird 326 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 = ((2 · 𝐴) + 1)) → ¬ 2 ∥ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃wrex 3063 class class class wbr 5072 (class class class)co 7356 1c1 11030 + caddc 11032 · cmul 11034 2c2 12227 ℤcz 12515 ∥ cdvds 16212 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-dvds 16213 |
| This theorem is referenced by: 2lgslem3b1 27382 2lgslem3c1 27383 limsup10exlem 46215 |
| Copyright terms: Public domain | W3C validator |