Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > asinlem | Structured version Visualization version GIF version |
Description: The argument to the logarithm in df-asin 25920 is always nonzero. (Contributed by Mario Carneiro, 31-Mar-2015.) |
Ref | Expression |
---|---|
asinlem | ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-icn 10861 | . . . 4 ⊢ i ∈ ℂ | |
2 | mulcl 10886 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
3 | 1, 2 | mpan 686 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ∈ ℂ) |
4 | ax-1cn 10860 | . . . . 5 ⊢ 1 ∈ ℂ | |
5 | sqcl 13766 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
6 | subcl 11150 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → (1 − (𝐴↑2)) ∈ ℂ) | |
7 | 4, 5, 6 | sylancr 586 | . . . 4 ⊢ (𝐴 ∈ ℂ → (1 − (𝐴↑2)) ∈ ℂ) |
8 | 7 | sqrtcld 15077 | . . 3 ⊢ (𝐴 ∈ ℂ → (√‘(1 − (𝐴↑2))) ∈ ℂ) |
9 | 3, 8 | subnegd 11269 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) = ((i · 𝐴) + (√‘(1 − (𝐴↑2))))) |
10 | 8 | negcld 11249 | . . 3 ⊢ (𝐴 ∈ ℂ → -(√‘(1 − (𝐴↑2))) ∈ ℂ) |
11 | 0ne1 11974 | . . . . . 6 ⊢ 0 ≠ 1 | |
12 | 0cnd 10899 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℂ) | |
13 | 1cnd 10901 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
14 | subcan2 11176 | . . . . . . . 8 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) = (1 − (𝐴↑2)) ↔ 0 = 1)) | |
15 | 14 | necon3bid 2987 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
16 | 12, 13, 5, 15 | syl3anc 1369 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
17 | 11, 16 | mpbiri 257 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (0 − (𝐴↑2)) ≠ (1 − (𝐴↑2))) |
18 | sqmul 13767 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) | |
19 | 1, 18 | mpan 686 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) |
20 | i2 13847 | . . . . . . . . 9 ⊢ (i↑2) = -1 | |
21 | 20 | oveq1i 7265 | . . . . . . . 8 ⊢ ((i↑2) · (𝐴↑2)) = (-1 · (𝐴↑2)) |
22 | 5 | mulm1d 11357 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (-1 · (𝐴↑2)) = -(𝐴↑2)) |
23 | 21, 22 | syl5eq 2791 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i↑2) · (𝐴↑2)) = -(𝐴↑2)) |
24 | 19, 23 | eqtrd 2778 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = -(𝐴↑2)) |
25 | df-neg 11138 | . . . . . 6 ⊢ -(𝐴↑2) = (0 − (𝐴↑2)) | |
26 | 24, 25 | eqtrdi 2795 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = (0 − (𝐴↑2))) |
27 | sqneg 13764 | . . . . . . 7 ⊢ ((√‘(1 − (𝐴↑2))) ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) | |
28 | 8, 27 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) |
29 | 7 | sqsqrtd 15079 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
30 | 28, 29 | eqtrd 2778 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
31 | 17, 26, 30 | 3netr4d 3020 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) ≠ (-(√‘(1 − (𝐴↑2)))↑2)) |
32 | oveq1 7262 | . . . . 5 ⊢ ((i · 𝐴) = -(√‘(1 − (𝐴↑2))) → ((i · 𝐴)↑2) = (-(√‘(1 − (𝐴↑2)))↑2)) | |
33 | 32 | necon3i 2975 | . . . 4 ⊢ (((i · 𝐴)↑2) ≠ (-(√‘(1 − (𝐴↑2)))↑2) → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
34 | 31, 33 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
35 | 3, 10, 34 | subne0d 11271 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) ≠ 0) |
36 | 9, 35 | eqnetrrd 3011 | 1 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 0cc0 10802 1c1 10803 ici 10804 + caddc 10805 · cmul 10807 − cmin 11135 -cneg 11136 2c2 11958 ↑cexp 13710 √csqrt 14872 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 |
This theorem is referenced by: asinlem3 25926 asinf 25927 asinneg 25941 efiasin 25943 asinbnd 25954 dvasin 35788 |
Copyright terms: Public domain | W3C validator |