| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 3sumcprm1o2difpar | Structured version Visualization version GIF version | ||
| Description: If one of three coprime summands is odd, the other two summands have different parities. (Contributed by AV, 3-Nov-2026.) |
| Ref | Expression |
|---|---|
| 3sumcprm1o2difpar.a | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| 3sumcprm1o2difpar.b | ⊢ (𝜑 → 𝐵 ∈ ℤ) |
| 3sumcprm1o2difpar.c | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| 3sumcprm1o2difpar.e | ⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = 0) |
| Ref | Expression |
|---|---|
| 3sumcprm1o2difpar | ⊢ (𝜑 → (¬ 2 ∥ 𝐶 → ¬ 2 ∥ (𝐴 + 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2z 12767 | . . . . . 6 ⊢ 2 ∈ ℤ | |
| 2 | 3sumcprm1o2difpar.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
| 3 | dvdsnegb 16485 | . . . . . 6 ⊢ ((2 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (2 ∥ 𝐶 ↔ 2 ∥ -𝐶)) | |
| 4 | 1, 2, 3 | sylancr 599 | . . . . 5 ⊢ (𝜑 → (2 ∥ 𝐶 ↔ 2 ∥ -𝐶)) |
| 5 | 4 | notbid 321 | . . . 4 ⊢ (𝜑 → (¬ 2 ∥ 𝐶 ↔ ¬ 2 ∥ -𝐶)) |
| 6 | 5 | biimpa 482 | . . 3 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝐶) → ¬ 2 ∥ -𝐶) |
| 7 | 3sumcprm1o2difpar.e | . . . . . 6 ⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = 0) | |
| 8 | 3sumcprm1o2difpar.a | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
| 9 | 3sumcprm1o2difpar.b | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℤ) | |
| 10 | 8, 9 | zaddcld 12846 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℤ) |
| 11 | 10 | zcnd 12843 | . . . . . . 7 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℂ) |
| 12 | 2 | zcnd 12843 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 13 | addeq0 11777 | . . . . . . 7 ⊢ (((𝐴 + 𝐵) ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 + 𝐵) + 𝐶) = 0 ↔ (𝐴 + 𝐵) = -𝐶)) | |
| 14 | 11, 12, 13 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (((𝐴 + 𝐵) + 𝐶) = 0 ↔ (𝐴 + 𝐵) = -𝐶)) |
| 15 | 7, 14 | mpbid 235 | . . . . 5 ⊢ (𝜑 → (𝐴 + 𝐵) = -𝐶) |
| 16 | 15 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝐶) → (𝐴 + 𝐵) = -𝐶) |
| 17 | 16 | breq2d 5119 | . . 3 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝐶) → (2 ∥ (𝐴 + 𝐵) ↔ 2 ∥ -𝐶)) |
| 18 | 6, 17 | mtbird 328 | . 2 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝐶) → ¬ 2 ∥ (𝐴 + 𝐵)) |
| 19 | 18 | ex 418 | 1 ⊢ (𝜑 → (¬ 2 ∥ 𝐶 → ¬ 2 ∥ (𝐴 + 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 class class class wbr 5107 (class class class)co 7450 ℂcc 11236 0cc0 11238 + caddc 11241 -cneg 11580 2c2 12436 ℤcz 12732 ∥ cdvds 16464 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-n0 12646 df-z 12733 df-dvds 16465 |
| This theorem is used by: flt3lemD 49918 |
| Copyright terms: Public domain | W3C validator |