| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > m1expaddsub | Structured version Visualization version GIF version | ||
| Description: Addition and subtraction of parities are the same. (Contributed by Stefan O'Rear, 27-Aug-2015.) |
| Ref | Expression |
|---|---|
| m1expaddsub | ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 − 𝑌)) = (-1↑(𝑋 + 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | m1expcl 14153 | . . . . . 6 ⊢ (𝑋 ∈ ℤ → (-1↑𝑋) ∈ ℤ) | |
| 2 | 1 | zcnd 12729 | . . . . 5 ⊢ (𝑋 ∈ ℤ → (-1↑𝑋) ∈ ℂ) |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑𝑋) ∈ ℂ) |
| 4 | m1expcl 14153 | . . . . . 6 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ∈ ℤ) | |
| 5 | 4 | zcnd 12729 | . . . . 5 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ∈ ℂ) |
| 6 | 5 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑𝑌) ∈ ℂ) |
| 7 | neg1cn 12230 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 8 | neg1ne0 12232 | . . . . . 6 ⊢ -1 ≠ 0 | |
| 9 | expne0i 14161 | . . . . . 6 ⊢ ((-1 ∈ ℂ ∧ -1 ≠ 0 ∧ 𝑌 ∈ ℤ) → (-1↑𝑌) ≠ 0) | |
| 10 | 7, 8, 9 | mp3an12 1480 | . . . . 5 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ≠ 0) |
| 11 | 10 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑𝑌) ≠ 0) |
| 12 | 3, 6, 11 | divrecd 12021 | . . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((-1↑𝑋) / (-1↑𝑌)) = ((-1↑𝑋) · (1 / (-1↑𝑌)))) |
| 13 | m1expcl2 14152 | . . . . . 6 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ∈ {-1, 1}) | |
| 14 | elpri 4608 | . . . . . 6 ⊢ ((-1↑𝑌) ∈ {-1, 1} → ((-1↑𝑌) = -1 ∨ (-1↑𝑌) = 1)) | |
| 15 | ax-1cn 11185 | . . . . . . . . . 10 ⊢ 1 ∈ ℂ | |
| 16 | ax-1ne0 11196 | . . . . . . . . . 10 ⊢ 1 ≠ 0 | |
| 17 | divneg2 11966 | . . . . . . . . . 10 ⊢ ((1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 1 ≠ 0) → -(1 / 1) = (1 / -1)) | |
| 18 | 15, 15, 16, 17 | mp3an 1490 | . . . . . . . . 9 ⊢ -(1 / 1) = (1 / -1) |
| 19 | 1div1e1 11932 | . . . . . . . . . 10 ⊢ (1 / 1) = 1 | |
| 20 | 19 | negeqi 11477 | . . . . . . . . 9 ⊢ -(1 / 1) = -1 |
| 21 | 18, 20 | eqtr3i 2785 | . . . . . . . 8 ⊢ (1 / -1) = -1 |
| 22 | oveq2 7422 | . . . . . . . 8 ⊢ ((-1↑𝑌) = -1 → (1 / (-1↑𝑌)) = (1 / -1)) | |
| 23 | id 23 | . . . . . . . 8 ⊢ ((-1↑𝑌) = -1 → (-1↑𝑌) = -1) | |
| 24 | 21, 22, 23 | 3eqtr4a 2821 | . . . . . . 7 ⊢ ((-1↑𝑌) = -1 → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 25 | oveq2 7422 | . . . . . . . 8 ⊢ ((-1↑𝑌) = 1 → (1 / (-1↑𝑌)) = (1 / 1)) | |
| 26 | id 23 | . . . . . . . 8 ⊢ ((-1↑𝑌) = 1 → (-1↑𝑌) = 1) | |
| 27 | 19, 25, 26 | 3eqtr4a 2821 | . . . . . . 7 ⊢ ((-1↑𝑌) = 1 → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 28 | 24, 27 | jaoi 871 | . . . . . 6 ⊢ (((-1↑𝑌) = -1 ∨ (-1↑𝑌) = 1) → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 29 | 13, 14, 28 | 3syl 19 | . . . . 5 ⊢ (𝑌 ∈ ℤ → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 30 | 29 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 31 | 30 | oveq2d 7430 | . . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((-1↑𝑋) · (1 / (-1↑𝑌))) = ((-1↑𝑋) · (-1↑𝑌))) |
| 32 | 12, 31 | eqtrd 2795 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((-1↑𝑋) / (-1↑𝑌)) = ((-1↑𝑋) · (-1↑𝑌))) |
| 33 | expsub 14177 | . . 3 ⊢ (((-1 ∈ ℂ ∧ -1 ≠ 0) ∧ (𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ)) → (-1↑(𝑋 − 𝑌)) = ((-1↑𝑋) / (-1↑𝑌))) | |
| 34 | 7, 8, 33 | mpanl12 715 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 − 𝑌)) = ((-1↑𝑋) / (-1↑𝑌))) |
| 35 | expaddz 14173 | . . 3 ⊢ (((-1 ∈ ℂ ∧ -1 ≠ 0) ∧ (𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ)) → (-1↑(𝑋 + 𝑌)) = ((-1↑𝑋) · (-1↑𝑌))) | |
| 36 | 7, 8, 35 | mpanl12 715 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 + 𝑌)) = ((-1↑𝑋) · (-1↑𝑌))) |
| 37 | 32, 34, 36 | 3eqtr4d 2805 | 1 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 − 𝑌)) = (-1↑(𝑋 + 𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 {cpr 4586 (class class class)co 7414 ℂcc 11125 0cc0 11127 1c1 11128 + caddc 11130 · cmul 11132 − cmin 11468 -cneg 11469 / cdiv 11898 ℤcz 12618 ↑cexp 14128 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-n0 12532 df-z 12619 df-uz 12891 df-seq 14069 df-exp 14129 |
| This theorem is used by: psgnuni 19629 41prothprmlem2 48524 |
| Copyright terms: Public domain | W3C validator |