Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sqabsadd | Structured version Visualization version GIF version |
Description: Square of absolute value of sum. Proposition 10-3.7(g) of [Gleason] p. 133. (Contributed by NM, 21-Jan-2007.) |
Ref | Expression |
---|---|
sqabsadd | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 + 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) + (2 · (ℜ‘(𝐴 · (∗‘𝐵)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cjadd 14852 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + 𝐵)) = ((∗‘𝐴) + (∗‘𝐵))) | |
2 | 1 | oveq2d 7291 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · (∗‘(𝐴 + 𝐵))) = ((𝐴 + 𝐵) · ((∗‘𝐴) + (∗‘𝐵)))) |
3 | cjcl 14816 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) ∈ ℂ) | |
4 | cjcl 14816 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) ∈ ℂ) | |
5 | 3, 4 | anim12i 613 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ)) |
6 | muladd 11407 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ)) → ((𝐴 + 𝐵) · ((∗‘𝐴) + (∗‘𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) + ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) | |
7 | 5, 6 | mpdan 684 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · ((∗‘𝐴) + (∗‘𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) + ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
8 | 2, 7 | eqtrd 2778 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · (∗‘(𝐴 + 𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) + ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
9 | addcl 10953 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
10 | absvalsq 14992 | . . 3 ⊢ ((𝐴 + 𝐵) ∈ ℂ → ((abs‘(𝐴 + 𝐵))↑2) = ((𝐴 + 𝐵) · (∗‘(𝐴 + 𝐵)))) | |
11 | 9, 10 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 + 𝐵))↑2) = ((𝐴 + 𝐵) · (∗‘(𝐴 + 𝐵)))) |
12 | absvalsq 14992 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((abs‘𝐴)↑2) = (𝐴 · (∗‘𝐴))) | |
13 | absvalsq 14992 | . . . . 5 ⊢ (𝐵 ∈ ℂ → ((abs‘𝐵)↑2) = (𝐵 · (∗‘𝐵))) | |
14 | mulcom 10957 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (𝐵 · (∗‘𝐵)) = ((∗‘𝐵) · 𝐵)) | |
15 | 4, 14 | mpdan 684 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 · (∗‘𝐵)) = ((∗‘𝐵) · 𝐵)) |
16 | 13, 15 | eqtrd 2778 | . . . 4 ⊢ (𝐵 ∈ ℂ → ((abs‘𝐵)↑2) = ((∗‘𝐵) · 𝐵)) |
17 | 12, 16 | oveqan12d 7294 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) = ((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵))) |
18 | mulcl 10955 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (𝐴 · (∗‘𝐵)) ∈ ℂ) | |
19 | 4, 18 | sylan2 593 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · (∗‘𝐵)) ∈ ℂ) |
20 | 19 | addcjd 14923 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (∗‘𝐵)) + (∗‘(𝐴 · (∗‘𝐵)))) = (2 · (ℜ‘(𝐴 · (∗‘𝐵))))) |
21 | cjmul 14853 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · (∗‘(∗‘𝐵)))) | |
22 | 4, 21 | sylan2 593 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · (∗‘(∗‘𝐵)))) |
23 | cjcj 14851 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (∗‘(∗‘𝐵)) = 𝐵) | |
24 | 23 | adantl 482 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(∗‘𝐵)) = 𝐵) |
25 | 24 | oveq2d 7291 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) · (∗‘(∗‘𝐵))) = ((∗‘𝐴) · 𝐵)) |
26 | 22, 25 | eqtrd 2778 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · 𝐵)) |
27 | 26 | oveq2d 7291 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (∗‘𝐵)) + (∗‘(𝐴 · (∗‘𝐵)))) = ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵))) |
28 | 20, 27 | eqtr3d 2780 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · (ℜ‘(𝐴 · (∗‘𝐵)))) = ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵))) |
29 | 17, 28 | oveq12d 7293 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) + (2 · (ℜ‘(𝐴 · (∗‘𝐵))))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) + ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
30 | 8, 11, 29 | 3eqtr4d 2788 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 + 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) + (2 · (ℜ‘(𝐴 · (∗‘𝐵)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ‘cfv 6433 (class class class)co 7275 ℂcc 10869 + caddc 10874 · cmul 10876 2c2 12028 ↑cexp 13782 ∗ccj 14807 ℜcre 14808 abscabs 14945 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-seq 13722 df-exp 13783 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 |
This theorem is referenced by: abstri 15042 sqabsaddi 15117 cncph 29181 |
Copyright terms: Public domain | W3C validator |