![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sqrtcval2 | Structured version Visualization version GIF version |
Description: Explicit formula for the complex square root in terms of the square root of non-negative reals. The right side is slightly more compact than sqrtcval 40341. (Contributed by RP, 18-May-2024.) |
Ref | Expression |
---|---|
sqrtcval2 | ⊢ (𝐴 ∈ ℂ → (√‘𝐴) = ((√‘(((abs‘𝐴) + (ℜ‘𝐴)) / 2)) + (if((ℑ‘𝐴) < 0, -i, i) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sqrtcval 40341 | . 2 ⊢ (𝐴 ∈ ℂ → (√‘𝐴) = ((√‘(((abs‘𝐴) + (ℜ‘𝐴)) / 2)) + (i · (if((ℑ‘𝐴) < 0, -1, 1) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2)))))) | |
2 | ovif2 7231 | . . . . . . 7 ⊢ (i · if((ℑ‘𝐴) < 0, -1, 1)) = if((ℑ‘𝐴) < 0, (i · -1), (i · 1)) | |
3 | neg1cn 11739 | . . . . . . . . 9 ⊢ -1 ∈ ℂ | |
4 | ax-icn 10585 | . . . . . . . . 9 ⊢ i ∈ ℂ | |
5 | 4 | mulm1i 11074 | . . . . . . . . 9 ⊢ (-1 · i) = -i |
6 | 3, 4, 5 | mulcomli 10639 | . . . . . . . 8 ⊢ (i · -1) = -i |
7 | 4 | mulid1i 10634 | . . . . . . . 8 ⊢ (i · 1) = i |
8 | ifeq12 4442 | . . . . . . . 8 ⊢ (((i · -1) = -i ∧ (i · 1) = i) → if((ℑ‘𝐴) < 0, (i · -1), (i · 1)) = if((ℑ‘𝐴) < 0, -i, i)) | |
9 | 6, 7, 8 | mp2an 691 | . . . . . . 7 ⊢ if((ℑ‘𝐴) < 0, (i · -1), (i · 1)) = if((ℑ‘𝐴) < 0, -i, i) |
10 | 2, 9 | eqtr2i 2822 | . . . . . 6 ⊢ if((ℑ‘𝐴) < 0, -i, i) = (i · if((ℑ‘𝐴) < 0, -1, 1)) |
11 | 10 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ ℂ → if((ℑ‘𝐴) < 0, -i, i) = (i · if((ℑ‘𝐴) < 0, -1, 1))) |
12 | 11 | oveq1d 7150 | . . . 4 ⊢ (𝐴 ∈ ℂ → (if((ℑ‘𝐴) < 0, -i, i) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))) = ((i · if((ℑ‘𝐴) < 0, -1, 1)) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2)))) |
13 | 4 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ ℂ → i ∈ ℂ) |
14 | neg1rr 11740 | . . . . . . . 8 ⊢ -1 ∈ ℝ | |
15 | 1re 10630 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
16 | 14, 15 | ifcli 4471 | . . . . . . 7 ⊢ if((ℑ‘𝐴) < 0, -1, 1) ∈ ℝ |
17 | 16 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → if((ℑ‘𝐴) < 0, -1, 1) ∈ ℝ) |
18 | 17 | recnd 10658 | . . . . 5 ⊢ (𝐴 ∈ ℂ → if((ℑ‘𝐴) < 0, -1, 1) ∈ ℂ) |
19 | sqrtcvallem3 40338 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2)) ∈ ℝ) | |
20 | 19 | recnd 10658 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2)) ∈ ℂ) |
21 | 13, 18, 20 | mulassd 10653 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((i · if((ℑ‘𝐴) < 0, -1, 1)) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))) = (i · (if((ℑ‘𝐴) < 0, -1, 1) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))))) |
22 | 12, 21 | eqtrd 2833 | . . 3 ⊢ (𝐴 ∈ ℂ → (if((ℑ‘𝐴) < 0, -i, i) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))) = (i · (if((ℑ‘𝐴) < 0, -1, 1) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))))) |
23 | 22 | oveq2d 7151 | . 2 ⊢ (𝐴 ∈ ℂ → ((√‘(((abs‘𝐴) + (ℜ‘𝐴)) / 2)) + (if((ℑ‘𝐴) < 0, -i, i) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2)))) = ((√‘(((abs‘𝐴) + (ℜ‘𝐴)) / 2)) + (i · (if((ℑ‘𝐴) < 0, -1, 1) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2)))))) |
24 | 1, 23 | eqtr4d 2836 | 1 ⊢ (𝐴 ∈ ℂ → (√‘𝐴) = ((√‘(((abs‘𝐴) + (ℜ‘𝐴)) / 2)) + (if((ℑ‘𝐴) < 0, -i, i) · (√‘(((abs‘𝐴) − (ℜ‘𝐴)) / 2))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ifcif 4425 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 ℂcc 10524 ℝcr 10525 0cc0 10526 1c1 10527 ici 10528 + caddc 10529 · cmul 10531 < clt 10664 − cmin 10859 -cneg 10860 / cdiv 11286 2c2 11680 ℜcre 14448 ℑcim 14449 √csqrt 14584 abscabs 14585 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-seq 13365 df-exp 13426 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |