| 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 27081 is always nonzero. (Contributed by Mario Carneiro, 31-Mar-2015.) |
| Ref | Expression |
|---|---|
| asinlem | ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-icn 11174 | . . . 4 ⊢ i ∈ ℂ | |
| 2 | mulcl 11199 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ∈ ℂ) |
| 4 | ax-1cn 11173 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 5 | sqcl 14172 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
| 6 | subcl 11471 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → (1 − (𝐴↑2)) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 599 | . . . 4 ⊢ (𝐴 ∈ ℂ → (1 − (𝐴↑2)) ∈ ℂ) |
| 8 | 7 | sqrtcld 15515 | . . 3 ⊢ (𝐴 ∈ ℂ → (√‘(1 − (𝐴↑2))) ∈ ℂ) |
| 9 | 3, 8 | subnegd 11591 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) = ((i · 𝐴) + (√‘(1 − (𝐴↑2))))) |
| 10 | 8 | negcld 11571 | . . 3 ⊢ (𝐴 ∈ ℂ → -(√‘(1 − (𝐴↑2))) ∈ ℂ) |
| 11 | 0ne1 12327 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 12 | 0cnd 11214 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℂ) | |
| 13 | 1cnd 11217 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 14 | subcan2 11498 | . . . . . . . 8 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) = (1 − (𝐴↑2)) ↔ 0 = 1)) | |
| 15 | 14 | necon3bid 3004 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
| 16 | 12, 13, 5, 15 | syl3anc 1398 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
| 17 | 11, 16 | mpbiri 261 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (0 − (𝐴↑2)) ≠ (1 − (𝐴↑2))) |
| 18 | sqmul 14173 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) | |
| 19 | 1, 18 | mpan 703 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) |
| 20 | i2 14256 | . . . . . . . . 9 ⊢ (i↑2) = -1 | |
| 21 | 20 | oveq1i 7429 | . . . . . . . 8 ⊢ ((i↑2) · (𝐴↑2)) = (-1 · (𝐴↑2)) |
| 22 | 5 | mulm1d 11681 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (-1 · (𝐴↑2)) = -(𝐴↑2)) |
| 23 | 21, 22 | eqtrid 2812 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i↑2) · (𝐴↑2)) = -(𝐴↑2)) |
| 24 | 19, 23 | eqtrd 2800 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = -(𝐴↑2)) |
| 25 | df-neg 11459 | . . . . . 6 ⊢ -(𝐴↑2) = (0 − (𝐴↑2)) | |
| 26 | 24, 25 | eqtrdi 2816 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = (0 − (𝐴↑2))) |
| 27 | sqneg 14169 | . . . . . . 7 ⊢ ((√‘(1 − (𝐴↑2))) ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) | |
| 28 | 8, 27 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) |
| 29 | 7 | sqsqrtd 15517 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
| 30 | 28, 29 | eqtrd 2800 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (-(√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
| 31 | 17, 26, 30 | 3netr4d 3037 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) ≠ (-(√‘(1 − (𝐴↑2)))↑2)) |
| 32 | oveq1 7426 | . . . . 5 ⊢ ((i · 𝐴) = -(√‘(1 − (𝐴↑2))) → ((i · 𝐴)↑2) = (-(√‘(1 − (𝐴↑2)))↑2)) | |
| 33 | 32 | necon3i 2992 | . . . 4 ⊢ (((i · 𝐴)↑2) ≠ (-(√‘(1 − (𝐴↑2)))↑2) → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
| 34 | 31, 33 | syl 18 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
| 35 | 3, 10, 34 | subne0d 11593 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) ≠ 0) |
| 36 | 9, 35 | eqnetrrd 3028 | 1 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ‘cfv 6540 (class class class)co 7419 ℂcc 11113 0cc0 11115 1c1 11116 ici 11117 + caddc 11118 · cmul 11120 − cmin 11456 -cneg 11457 2c2 12310 ↑cexp 14115 √csqrt 15308 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-sup 9409 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-z 12607 df-uz 12879 df-rp 13033 df-seq 14056 df-exp 14116 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 |
| This theorem is used by: asinlem3 27087 asinf 27088 asinneg 27102 efiasin 27104 asinbnd 27115 dvasin 38412 |
| Copyright terms: Public domain | W3C validator |