| 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 26927 is always nonzero. (Contributed by Mario Carneiro, 31-Mar-2015.) |
| Ref | Expression |
|---|---|
| asinlem | ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-icn 11132 | . . . 4 ⊢ i ∈ ℂ | |
| 2 | mulcl 11157 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
| 3 | 1, 2 | mpan 700 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ∈ ℂ) |
| 4 | ax-1cn 11131 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 5 | sqcl 14131 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
| 6 | subcl 11429 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → (1 − (𝐴↑2)) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 596 | . . . 4 ⊢ (𝐴 ∈ ℂ → (1 − (𝐴↑2)) ∈ ℂ) |
| 8 | 7 | sqrtcld 15467 | . . 3 ⊢ (𝐴 ∈ ℂ → (√‘(1 − (𝐴↑2))) ∈ ℂ) |
| 9 | 3, 8 | subnegd 11549 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) = ((i · 𝐴) + (√‘(1 − (𝐴↑2))))) |
| 10 | 8 | negcld 11529 | . . 3 ⊢ (𝐴 ∈ ℂ → -(√‘(1 − (𝐴↑2))) ∈ ℂ) |
| 11 | 0ne1 12289 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 12 | 0cnd 11172 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℂ) | |
| 13 | 1cnd 11175 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 14 | subcan2 11456 | . . . . . . . 8 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) = (1 − (𝐴↑2)) ↔ 0 = 1)) | |
| 15 | 14 | necon3bid 3001 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
| 16 | 12, 13, 5, 15 | syl3anc 1390 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
| 17 | 11, 16 | mpbiri 260 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (0 − (𝐴↑2)) ≠ (1 − (𝐴↑2))) |
| 18 | sqmul 14132 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) | |
| 19 | 1, 18 | mpan 700 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) |
| 20 | i2 14215 | . . . . . . . . 9 ⊢ (i↑2) = -1 | |
| 21 | 20 | oveq1i 7406 | . . . . . . . 8 ⊢ ((i↑2) · (𝐴↑2)) = (-1 · (𝐴↑2)) |
| 22 | 5 | mulm1d 11639 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (-1 · (𝐴↑2)) = -(𝐴↑2)) |
| 23 | 21, 22 | eqtrid 2809 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i↑2) · (𝐴↑2)) = -(𝐴↑2)) |
| 24 | 19, 23 | eqtrd 2797 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = -(𝐴↑2)) |
| 25 | df-neg 11417 | . . . . . 6 ⊢ -(𝐴↑2) = (0 − (𝐴↑2)) | |
| 26 | 24, 25 | eqtrdi 2813 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = (0 − (𝐴↑2))) |
| 27 | sqneg 14128 | . . . . . . 7 ⊢ ((√‘(1 − (𝐴↑2))) ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) | |
| 28 | 8, 27 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) |
| 29 | 7 | sqsqrtd 15469 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
| 30 | 28, 29 | eqtrd 2797 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
| 31 | 17, 26, 30 | 3netr4d 3034 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) ≠ (-(√‘(1 − (𝐴↑2)))↑2)) |
| 32 | oveq1 7403 | . . . . 5 ⊢ ((i · 𝐴) = -(√‘(1 − (𝐴↑2))) → ((i · 𝐴)↑2) = (-(√‘(1 − (𝐴↑2)))↑2)) | |
| 33 | 32 | necon3i 2989 | . . . 4 ⊢ (((i · 𝐴)↑2) ≠ (-(√‘(1 − (𝐴↑2)))↑2) → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
| 34 | 31, 33 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
| 35 | 3, 10, 34 | subne0d 11551 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) ≠ 0) |
| 36 | 9, 35 | eqnetrrd 3025 | 1 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 ‘cfv 6521 (class class class)co 7396 ℂcc 11071 0cc0 11073 1c1 11074 ici 11075 + caddc 11076 · cmul 11078 − cmin 11414 -cneg 11415 2c2 12272 ↑cexp 14074 √csqrt 15260 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 ax-pre-sup 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9388 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-3 12281 df-n0 12482 df-z 12569 df-uz 12840 df-rp 12994 df-seq 14015 df-exp 14075 df-cj 15126 df-re 15127 df-im 15128 df-sqrt 15262 df-abs 15263 |
| This theorem is referenced by: asinlem3 26933 asinf 26934 asinneg 26948 efiasin 26950 asinbnd 26961 dvasin 38200 |
| Copyright terms: Public domain | W3C validator |