| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sqabssub | Structured version Visualization version GIF version | ||
| Description: Square of absolute value of difference. (Contributed by NM, 21-Jan-2007.) |
| Ref | Expression |
|---|---|
| sqabssub | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 − 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) − (2 · (ℜ‘(𝐴 · (∗‘𝐵)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cjsub 15168 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 − 𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) | |
| 2 | 1 | oveq2d 7421 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵))) = ((𝐴 − 𝐵) · ((∗‘𝐴) − (∗‘𝐵)))) |
| 3 | cjcl 15124 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) ∈ ℂ) | |
| 4 | cjcl 15124 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) ∈ ℂ) | |
| 5 | 3, 4 | anim12i 613 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ)) |
| 6 | mulsub 11680 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ)) → ((𝐴 − 𝐵) · ((∗‘𝐴) − (∗‘𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) | |
| 7 | 5, 6 | mpdan 687 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) · ((∗‘𝐴) − (∗‘𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
| 8 | 2, 7 | eqtrd 2770 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
| 9 | subcl 11481 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 10 | absvalsq 15299 | . . 3 ⊢ ((𝐴 − 𝐵) ∈ ℂ → ((abs‘(𝐴 − 𝐵))↑2) = ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵)))) | |
| 11 | 9, 10 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 − 𝐵))↑2) = ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵)))) |
| 12 | absvalsq 15299 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((abs‘𝐴)↑2) = (𝐴 · (∗‘𝐴))) | |
| 13 | absvalsq 15299 | . . . . 5 ⊢ (𝐵 ∈ ℂ → ((abs‘𝐵)↑2) = (𝐵 · (∗‘𝐵))) | |
| 14 | mulcom 11215 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (𝐵 · (∗‘𝐵)) = ((∗‘𝐵) · 𝐵)) | |
| 15 | 4, 14 | mpdan 687 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 · (∗‘𝐵)) = ((∗‘𝐵) · 𝐵)) |
| 16 | 13, 15 | eqtrd 2770 | . . . 4 ⊢ (𝐵 ∈ ℂ → ((abs‘𝐵)↑2) = ((∗‘𝐵) · 𝐵)) |
| 17 | 12, 16 | oveqan12d 7424 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) = ((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵))) |
| 18 | mulcl 11213 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (𝐴 · (∗‘𝐵)) ∈ ℂ) | |
| 19 | 4, 18 | sylan2 593 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · (∗‘𝐵)) ∈ ℂ) |
| 20 | 19 | addcjd 15231 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (∗‘𝐵)) + (∗‘(𝐴 · (∗‘𝐵)))) = (2 · (ℜ‘(𝐴 · (∗‘𝐵))))) |
| 21 | cjmul 15161 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · (∗‘(∗‘𝐵)))) | |
| 22 | 4, 21 | sylan2 593 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · (∗‘(∗‘𝐵)))) |
| 23 | cjcj 15159 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (∗‘(∗‘𝐵)) = 𝐵) | |
| 24 | 23 | adantl 481 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(∗‘𝐵)) = 𝐵) |
| 25 | 24 | oveq2d 7421 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) · (∗‘(∗‘𝐵))) = ((∗‘𝐴) · 𝐵)) |
| 26 | 22, 25 | eqtrd 2770 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · 𝐵)) |
| 27 | 26 | oveq2d 7421 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (∗‘𝐵)) + (∗‘(𝐴 · (∗‘𝐵)))) = ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵))) |
| 28 | 20, 27 | eqtr3d 2772 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · (ℜ‘(𝐴 · (∗‘𝐵)))) = ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵))) |
| 29 | 17, 28 | oveq12d 7423 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) − (2 · (ℜ‘(𝐴 · (∗‘𝐵))))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
| 30 | 8, 11, 29 | 3eqtr4d 2780 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 − 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) − (2 · (ℜ‘(𝐴 · (∗‘𝐵)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 + caddc 11132 · cmul 11134 − cmin 11466 2c2 12295 ↑cexp 14079 ∗ccj 15115 ℜcre 15116 abscabs 15253 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 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 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-sup 9454 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-seq 14020 df-exp 14080 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 |
| This theorem is referenced by: sqabssubi 15425 lawcoslem1 26777 cncph 30800 |
| Copyright terms: Public domain | W3C validator |