| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sqabssub | 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 11602 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 − 𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) | |
| 2 | 1 | oveq2d 6074 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵))) = ((𝐴 − 𝐵) · ((∗‘𝐴) − (∗‘𝐵)))) |
| 3 | cjcl 11558 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) ∈ ℂ) | |
| 4 | cjcl 11558 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) ∈ ℂ) | |
| 5 | 3, 4 | anim12i 338 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ)) |
| 6 | mulsub 8691 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ)) → ((𝐴 − 𝐵) · ((∗‘𝐴) − (∗‘𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) | |
| 7 | 5, 6 | mpdan 421 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) · ((∗‘𝐴) − (∗‘𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
| 8 | 2, 7 | eqtrd 2267 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
| 9 | subcl 8488 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 10 | absvalsq 11763 | . . 3 ⊢ ((𝐴 − 𝐵) ∈ ℂ → ((abs‘(𝐴 − 𝐵))↑2) = ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵)))) | |
| 11 | 9, 10 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 − 𝐵))↑2) = ((𝐴 − 𝐵) · (∗‘(𝐴 − 𝐵)))) |
| 12 | absvalsq 11763 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((abs‘𝐴)↑2) = (𝐴 · (∗‘𝐴))) | |
| 13 | absvalsq 11763 | . . . . 5 ⊢ (𝐵 ∈ ℂ → ((abs‘𝐵)↑2) = (𝐵 · (∗‘𝐵))) | |
| 14 | mulcom 8272 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (𝐵 · (∗‘𝐵)) = ((∗‘𝐵) · 𝐵)) | |
| 15 | 4, 14 | mpdan 421 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 · (∗‘𝐵)) = ((∗‘𝐵) · 𝐵)) |
| 16 | 13, 15 | eqtrd 2267 | . . . 4 ⊢ (𝐵 ∈ ℂ → ((abs‘𝐵)↑2) = ((∗‘𝐵) · 𝐵)) |
| 17 | 12, 16 | oveqan12d 6077 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) = ((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵))) |
| 18 | mulcl 8270 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (𝐴 · (∗‘𝐵)) ∈ ℂ) | |
| 19 | 4, 18 | sylan2 286 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · (∗‘𝐵)) ∈ ℂ) |
| 20 | 19 | addcjd 11667 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (∗‘𝐵)) + (∗‘(𝐴 · (∗‘𝐵)))) = (2 · (ℜ‘(𝐴 · (∗‘𝐵))))) |
| 21 | cjmul 11595 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · (∗‘(∗‘𝐵)))) | |
| 22 | 4, 21 | sylan2 286 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · (∗‘(∗‘𝐵)))) |
| 23 | cjcj 11593 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (∗‘(∗‘𝐵)) = 𝐵) | |
| 24 | 23 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(∗‘𝐵)) = 𝐵) |
| 25 | 24 | oveq2d 6074 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) · (∗‘(∗‘𝐵))) = ((∗‘𝐴) · 𝐵)) |
| 26 | 22, 25 | eqtrd 2267 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 · (∗‘𝐵))) = ((∗‘𝐴) · 𝐵)) |
| 27 | 26 | oveq2d 6074 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (∗‘𝐵)) + (∗‘(𝐴 · (∗‘𝐵)))) = ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵))) |
| 28 | 20, 27 | eqtr3d 2269 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · (ℜ‘(𝐴 · (∗‘𝐵)))) = ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵))) |
| 29 | 17, 28 | oveq12d 6076 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) − (2 · (ℜ‘(𝐴 · (∗‘𝐵))))) = (((𝐴 · (∗‘𝐴)) + ((∗‘𝐵) · 𝐵)) − ((𝐴 · (∗‘𝐵)) + ((∗‘𝐴) · 𝐵)))) |
| 30 | 8, 11, 29 | 3eqtr4d 2277 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘(𝐴 − 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) − (2 · (ℜ‘(𝐴 · (∗‘𝐵)))))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ‘cfv 5357 (class class class)co 6058 ℂcc 8141 + caddc 8146 · cmul 8148 − cmin 8460 2c2 9305 ↑cexp 10924 ∗ccj 11549 ℜcre 11550 abscabs 11707 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 ax-arch 8262 ax-caucvg 8263 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-2 9313 df-3 9314 df-4 9315 df-n0 9514 df-z 9595 df-uz 9872 df-rp 10005 df-seqfrec 10834 df-exp 10925 df-cj 11552 df-re 11553 df-im 11554 df-rsqrt 11708 df-abs 11709 |
| This theorem is referenced by: sqabssubi 11863 |
| Copyright terms: Public domain | W3C validator |