| 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 14239 | . . . . . 6 ⊢ (𝑋 ∈ ℤ → ( -1↑𝑋) ∈ ℤ) | |
| 2 | 1 | zcnd 12814 | . . . . 5 ⊢ (𝑋 ∈ ℤ → ( -1↑𝑋) ∈ ℂ) |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ( -1↑𝑋) ∈ ℂ) |
| 4 | m1expcl 14239 | . . . . . 6 ⊢ (𝑌 ∈ ℤ → ( -1↑𝑌) ∈ ℤ) | |
| 5 | 4 | zcnd 12814 | . . . . 5 ⊢ (𝑌 ∈ ℤ → ( -1↑𝑌) ∈ ℂ) |
| 6 | 5 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ( -1↑𝑌) ∈ ℂ) |
| 7 | neg1cn 12315 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 8 | neg1ne0 12317 | . . . . . 6 ⊢ -1 ≠ 0 | |
| 9 | expne0i 14247 | . . . . . 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 12106 | . . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (( -1↑𝑋) / ( -1↑𝑌)) = (( -1↑𝑋) · (1 / ( -1↑𝑌)))) |
| 13 | m1expcl2 14238 | . . . . . 6 ⊢ (𝑌 ∈ ℤ → ( -1↑𝑌) ∈ { -1, 1}) | |
| 14 | elpri 4607 | . . . . . 6 ⊢ (( -1↑𝑌) ∈ { -1, 1} → (( -1↑𝑌) = -1 ∨ ( -1↑𝑌) = 1)) | |
| 15 | ax-1cn 11268 | . . . . . . . . . 10 ⊢ 1 ∈ ℂ | |
| 16 | ax-1ne0 11279 | . . . . . . . . . 10 ⊢ 1 ≠ 0 | |
| 17 | divneg2 12051 | . . . . . . . . . 10 ⊢ ((1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 1 ≠ 0) → -(1 / 1) = (1 / -1)) | |
| 18 | 15, 15, 16, 17 | mp3an 1490 | . . . . . . . . 9 ⊢ -(1 / 1) = (1 / -1) |
| 19 | 1div1e1 12017 | . . . . . . . . . 10 ⊢ (1 / 1) = 1 | |
| 20 | 19 | negeqi 11560 | . . . . . . . . 9 ⊢ -(1 / 1) = -1 |
| 21 | 18, 20 | eqtr3i 2788 | . . . . . . . 8 ⊢ (1 / -1) = -1 |
| 22 | oveq2 7435 | . . . . . . . 8 ⊢ (( -1↑𝑌) = -1 → (1 / ( -1↑𝑌)) = (1 / -1)) | |
| 23 | id 23 | . . . . . . . 8 ⊢ (( -1↑𝑌) = -1 → ( -1↑𝑌) = -1) | |
| 24 | 21, 22, 23 | 3eqtr4a 2824 | . . . . . . 7 ⊢ (( -1↑𝑌) = -1 → (1 / ( -1↑𝑌)) = ( -1↑𝑌)) |
| 25 | oveq2 7435 | . . . . . . . 8 ⊢ (( -1↑𝑌) = 1 → (1 / ( -1↑𝑌)) = (1 / 1)) | |
| 26 | id 23 | . . . . . . . 8 ⊢ (( -1↑𝑌) = 1 → ( -1↑𝑌) = 1) | |
| 27 | 19, 25, 26 | 3eqtr4a 2824 | . . . . . . 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 7443 | . . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (( -1↑𝑋) · (1 / ( -1↑𝑌))) = (( -1↑𝑋) · ( -1↑𝑌))) |
| 32 | 12, 31 | eqtrd 2798 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (( -1↑𝑋) / ( -1↑𝑌)) = (( -1↑𝑋) · ( -1↑𝑌))) |
| 33 | expsub 14263 | . . 3 ⊢ ((( -1 ∈ ℂ ∧ -1 ≠ 0) ∧ (𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ)) → ( -1↑(𝑋 − 𝑌)) = (( -1↑𝑋) / ( -1↑𝑌))) | |
| 34 | 7, 8, 33 | mpanl12 715 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ( -1↑(𝑋 − 𝑌)) = (( -1↑𝑋) / ( -1↑𝑌))) |
| 35 | expaddz 14259 | . . 3 ⊢ ((( -1 ∈ ℂ ∧ -1 ≠ 0) ∧ (𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ)) → ( -1↑(𝑋 + 𝑌)) = (( -1↑𝑋) · ( -1↑𝑌))) | |
| 36 | 7, 8, 35 | mpanl12 715 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ( -1↑(𝑋 + 𝑌)) = (( -1↑𝑋) · ( -1↑𝑌))) |
| 37 | 32, 34, 36 | 3eqtr4d 2808 | 1 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ( -1↑(𝑋 − 𝑌)) = ( -1↑(𝑋 + 𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 {cpr 4589 (class class class)co 7427 ℂcc 11208 0cc0 11210 1c1 11211 + caddc 11213 · cmul 11215 − cmin 11551 -cneg 11552 / cdiv 11983 ℤcz 12703 ↑cexp 14214 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 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 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-n0 12617 df-z 12704 df-uz 12976 df-seq 14155 df-exp 14215 |
| This theorem is used by: psgnuni 19725 41prothprmlem2 48842 |
| Copyright terms: Public domain | W3C validator |