| 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 13993 | . . . . . 6 ⊢ (𝑋 ∈ ℤ → (-1↑𝑋) ∈ ℤ) | |
| 2 | 1 | zcnd 12578 | . . . . 5 ⊢ (𝑋 ∈ ℤ → (-1↑𝑋) ∈ ℂ) |
| 3 | 2 | adantr 480 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑𝑋) ∈ ℂ) |
| 4 | m1expcl 13993 | . . . . . 6 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ∈ ℤ) | |
| 5 | 4 | zcnd 12578 | . . . . 5 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ∈ ℂ) |
| 6 | 5 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑𝑌) ∈ ℂ) |
| 7 | neg1cn 12110 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 8 | neg1ne0 12112 | . . . . . 6 ⊢ -1 ≠ 0 | |
| 9 | expne0i 14001 | . . . . . 6 ⊢ ((-1 ∈ ℂ ∧ -1 ≠ 0 ∧ 𝑌 ∈ ℤ) → (-1↑𝑌) ≠ 0) | |
| 10 | 7, 8, 9 | mp3an12 1453 | . . . . 5 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ≠ 0) |
| 11 | 10 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑𝑌) ≠ 0) |
| 12 | 3, 6, 11 | divrecd 11900 | . . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((-1↑𝑋) / (-1↑𝑌)) = ((-1↑𝑋) · (1 / (-1↑𝑌)))) |
| 13 | m1expcl2 13992 | . . . . . 6 ⊢ (𝑌 ∈ ℤ → (-1↑𝑌) ∈ {-1, 1}) | |
| 14 | elpri 4597 | . . . . . 6 ⊢ ((-1↑𝑌) ∈ {-1, 1} → ((-1↑𝑌) = -1 ∨ (-1↑𝑌) = 1)) | |
| 15 | ax-1cn 11064 | . . . . . . . . . 10 ⊢ 1 ∈ ℂ | |
| 16 | ax-1ne0 11075 | . . . . . . . . . 10 ⊢ 1 ≠ 0 | |
| 17 | divneg2 11845 | . . . . . . . . . 10 ⊢ ((1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 1 ≠ 0) → -(1 / 1) = (1 / -1)) | |
| 18 | 15, 15, 16, 17 | mp3an 1463 | . . . . . . . . 9 ⊢ -(1 / 1) = (1 / -1) |
| 19 | 1div1e1 11812 | . . . . . . . . . 10 ⊢ (1 / 1) = 1 | |
| 20 | 19 | negeqi 11353 | . . . . . . . . 9 ⊢ -(1 / 1) = -1 |
| 21 | 18, 20 | eqtr3i 2756 | . . . . . . . 8 ⊢ (1 / -1) = -1 |
| 22 | oveq2 7354 | . . . . . . . 8 ⊢ ((-1↑𝑌) = -1 → (1 / (-1↑𝑌)) = (1 / -1)) | |
| 23 | id 22 | . . . . . . . 8 ⊢ ((-1↑𝑌) = -1 → (-1↑𝑌) = -1) | |
| 24 | 21, 22, 23 | 3eqtr4a 2792 | . . . . . . 7 ⊢ ((-1↑𝑌) = -1 → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 25 | oveq2 7354 | . . . . . . . 8 ⊢ ((-1↑𝑌) = 1 → (1 / (-1↑𝑌)) = (1 / 1)) | |
| 26 | id 22 | . . . . . . . 8 ⊢ ((-1↑𝑌) = 1 → (-1↑𝑌) = 1) | |
| 27 | 19, 25, 26 | 3eqtr4a 2792 | . . . . . . 7 ⊢ ((-1↑𝑌) = 1 → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 28 | 24, 27 | jaoi 857 | . . . . . 6 ⊢ (((-1↑𝑌) = -1 ∨ (-1↑𝑌) = 1) → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 29 | 13, 14, 28 | 3syl 18 | . . . . 5 ⊢ (𝑌 ∈ ℤ → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 30 | 29 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (1 / (-1↑𝑌)) = (-1↑𝑌)) |
| 31 | 30 | oveq2d 7362 | . . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((-1↑𝑋) · (1 / (-1↑𝑌))) = ((-1↑𝑋) · (-1↑𝑌))) |
| 32 | 12, 31 | eqtrd 2766 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((-1↑𝑋) / (-1↑𝑌)) = ((-1↑𝑋) · (-1↑𝑌))) |
| 33 | expsub 14017 | . . 3 ⊢ (((-1 ∈ ℂ ∧ -1 ≠ 0) ∧ (𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ)) → (-1↑(𝑋 − 𝑌)) = ((-1↑𝑋) / (-1↑𝑌))) | |
| 34 | 7, 8, 33 | mpanl12 702 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 − 𝑌)) = ((-1↑𝑋) / (-1↑𝑌))) |
| 35 | expaddz 14013 | . . 3 ⊢ (((-1 ∈ ℂ ∧ -1 ≠ 0) ∧ (𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ)) → (-1↑(𝑋 + 𝑌)) = ((-1↑𝑋) · (-1↑𝑌))) | |
| 36 | 7, 8, 35 | mpanl12 702 | . 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 + 𝑌)) = ((-1↑𝑋) · (-1↑𝑌))) |
| 37 | 32, 34, 36 | 3eqtr4d 2776 | 1 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (-1↑(𝑋 − 𝑌)) = (-1↑(𝑋 + 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 {cpr 4575 (class class class)co 7346 ℂcc 11004 0cc0 11006 1c1 11007 + caddc 11009 · cmul 11011 − cmin 11344 -cneg 11345 / cdiv 11774 ℤcz 12468 ↑cexp 13968 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-n0 12382 df-z 12469 df-uz 12733 df-seq 13909 df-exp 13969 |
| This theorem is referenced by: psgnuni 19411 41prothprmlem2 47728 |
| Copyright terms: Public domain | W3C validator |