Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > asinlem3a | Structured version Visualization version GIF version |
Description: Lemma for asinlem3 24398. (Contributed by Mario Carneiro, 1-Apr-2015.) |
Ref | Expression |
---|---|
asinlem3a | ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imcl 13699 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) ∈ ℝ) | |
2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℑ‘𝐴) ∈ ℝ) |
3 | 2 | renegcld 10336 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → -(ℑ‘𝐴) ∈ ℝ) |
4 | ax-1cn 9873 | . . . . . 6 ⊢ 1 ∈ ℂ | |
5 | sqcl 12787 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
6 | 5 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (𝐴↑2) ∈ ℂ) |
7 | subcl 10159 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → (1 − (𝐴↑2)) ∈ ℂ) | |
8 | 4, 6, 7 | sylancr 694 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (1 − (𝐴↑2)) ∈ ℂ) |
9 | 8 | sqrtcld 14024 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (√‘(1 − (𝐴↑2))) ∈ ℂ) |
10 | 9 | recld 13782 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘(√‘(1 − (𝐴↑2)))) ∈ ℝ) |
11 | 1 | le0neg1d 10478 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((ℑ‘𝐴) ≤ 0 ↔ 0 ≤ -(ℑ‘𝐴))) |
12 | 11 | biimpa 500 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ -(ℑ‘𝐴)) |
13 | 8 | sqrtrege0d 14025 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (ℜ‘(√‘(1 − (𝐴↑2))))) |
14 | 3, 10, 12, 13 | addge0d 10482 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (-(ℑ‘𝐴) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
15 | ax-icn 9874 | . . . . 5 ⊢ i ∈ ℂ | |
16 | simpl 472 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 𝐴 ∈ ℂ) | |
17 | mulcl 9899 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
18 | 15, 16, 17 | sylancr 694 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (i · 𝐴) ∈ ℂ) |
19 | 18, 9 | readdd 13802 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2))))) = ((ℜ‘(i · 𝐴)) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
20 | negicn 10161 | . . . . . . 7 ⊢ -i ∈ ℂ | |
21 | mulcl 9899 | . . . . . . 7 ⊢ ((-i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (-i · 𝐴) ∈ ℂ) | |
22 | 20, 16, 21 | sylancr 694 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (-i · 𝐴) ∈ ℂ) |
23 | 22 | renegd 13797 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘-(-i · 𝐴)) = -(ℜ‘(-i · 𝐴))) |
24 | 15 | negnegi 10230 | . . . . . . . 8 ⊢ --i = i |
25 | 24 | oveq1i 6559 | . . . . . . 7 ⊢ (--i · 𝐴) = (i · 𝐴) |
26 | mulneg1 10345 | . . . . . . . 8 ⊢ ((-i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (--i · 𝐴) = -(-i · 𝐴)) | |
27 | 20, 16, 26 | sylancr 694 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (--i · 𝐴) = -(-i · 𝐴)) |
28 | 25, 27 | syl5eqr 2658 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (i · 𝐴) = -(-i · 𝐴)) |
29 | 28 | fveq2d 6107 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘(i · 𝐴)) = (ℜ‘-(-i · 𝐴))) |
30 | imre 13696 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (ℑ‘𝐴) = (ℜ‘(-i · 𝐴))) | |
31 | 30 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℑ‘𝐴) = (ℜ‘(-i · 𝐴))) |
32 | 31 | negeqd 10154 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → -(ℑ‘𝐴) = -(ℜ‘(-i · 𝐴))) |
33 | 23, 29, 32 | 3eqtr4d 2654 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘(i · 𝐴)) = -(ℑ‘𝐴)) |
34 | 33 | oveq1d 6564 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → ((ℜ‘(i · 𝐴)) + (ℜ‘(√‘(1 − (𝐴↑2))))) = (-(ℑ‘𝐴) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
35 | 19, 34 | eqtrd 2644 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2))))) = (-(ℑ‘𝐴) + (ℜ‘(√‘(1 − (𝐴↑2)))))) |
36 | 14, 35 | breqtrrd 4611 | 1 ⊢ ((𝐴 ∈ ℂ ∧ (ℑ‘𝐴) ≤ 0) → 0 ≤ (ℜ‘((i · 𝐴) + (√‘(1 − (𝐴↑2)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 ici 9817 + caddc 9818 · cmul 9820 ≤ cle 9954 − cmin 10145 -cneg 10146 2c2 10947 ↑cexp 12722 ℜcre 13685 ℑcim 13686 √csqrt 13821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-seq 12664 df-exp 12723 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 |
This theorem is referenced by: asinlem3 24398 |
Copyright terms: Public domain | W3C validator |