Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > asinlem3a | Structured version Visualization version GIF version |
Description: Lemma for asinlem3 24598. (Contributed by Mario Carneiro, 1-Apr-2015.) |
Ref | Expression |
---|---|
asinlem3a | ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imcl 13851 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
2 | 1 | adantr 481 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℑ‘𝐴) ∈ ℝ) |
3 | 2 | renegcld 10457 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → -(ℑ‘𝐴) ∈ ℝ) |
4 | ax-1cn 9994 | . . . . . 6 ⊢ 1 ∈ ℂ | |
5 | sqcl 12925 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
6 | 5 | adantr 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (𝐴↑2) ∈ ℂ) |
7 | subcl 10280 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → (1 − (𝐴↑2)) ∈ ℂ) | |
8 | 4, 6, 7 | sylancr 695 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (1 − (𝐴↑2)) ∈ ℂ) |
9 | 8 | sqrtcld 14176 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (√‘(1 − (𝐴↑2))) ∈ ℂ) |
10 | 9 | recld 13934 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘(√‘(1 − (𝐴↑2)))) ∈ ℝ) |
11 | 1 | le0neg1d 10599 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((ℑ‘𝐴) ≤ 0 ↔ 0 ≤ -(ℑ‘𝐴))) |
12 | 11 | biimpa 501 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ -(ℑ‘𝐴)) |
13 | 8 | sqrtrege0d 14177 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (ℜ‘(√‘(1 − (𝐴↑2))))) |
14 | 3, 10, 12, 13 | addge0d 10603 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (-(ℑ‘𝐴) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
15 | ax-icn 9995 | . . . . 5 ⊢ i ∈ ℂ | |
16 | simpl 473 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 𝐴 ∈ ℂ) | |
17 | mulcl 10020 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
18 | 15, 16, 17 | sylancr 695 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (i · 𝐴) ∈ ℂ) |
19 | 18, 9 | readdd 13954 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2))))) = ((ℜ‘(i · 𝐴)) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
20 | negicn 10282 | . . . . . . 7 ⊢ -i ∈ ℂ | |
21 | mulcl 10020 | . . . . . . 7 ⊢ ((-i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (-i · 𝐴) ∈ ℂ) | |
22 | 20, 16, 21 | sylancr 695 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (-i · 𝐴) ∈ ℂ) |
23 | 22 | renegd 13949 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘-(-i · 𝐴)) = -(ℜ‘(-i · 𝐴))) |
24 | 15 | negnegi 10351 | . . . . . . . 8 ⊢ --i = i |
25 | 24 | oveq1i 6660 | . . . . . . 7 ⊢ (--i · 𝐴) = (i · 𝐴) |
26 | mulneg1 10466 | . . . . . . . 8 ⊢ ((-i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (--i · 𝐴) = -(-i · 𝐴)) | |
27 | 20, 16, 26 | sylancr 695 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (--i · 𝐴) = -(-i · 𝐴)) |
28 | 25, 27 | syl5eqr 2670 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (i · 𝐴) = -(-i · 𝐴)) |
29 | 28 | fveq2d 6195 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘(i · 𝐴)) = (ℜ‘-(-i · 𝐴))) |
30 | imre 13848 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) = (ℜ‘(-i · 𝐴))) | |
31 | 30 | adantr 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℑ‘𝐴) = (ℜ‘(-i · 𝐴))) |
32 | 31 | negeqd 10275 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → -(ℑ‘𝐴) = -(ℜ‘(-i · 𝐴))) |
33 | 23, 29, 32 | 3eqtr4d 2666 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘(i · 𝐴)) = -(ℑ‘𝐴)) |
34 | 33 | oveq1d 6665 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → ((ℜ‘(i · 𝐴)) + (ℜ‘(√‘(1 − (𝐴↑2))))) = (-(ℑ‘𝐴) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
35 | 19, 34 | eqtrd 2656 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2))))) = (-(ℑ‘𝐴) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
36 | 14, 35 | breqtrrd 4681 | 1 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 ℂcc 9934 ℝcr 9935 0cc0 9936 1c1 9937 ici 9938 + caddc 9939 · cmul 9941 ≤ cle 10075 − cmin 10266 -cneg 10267 2c2 11070 ↑cexp 12860 ℜcre 13837 ℑcim 13838 √csqrt 13973 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 |
This theorem is referenced by: asinlem3 24598 |
Copyright terms: Public domain | W3C validator |