| 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 27250 is always nonzero. (Contributed by Mario Carneiro, 31-Mar-2015.) |
| Ref | Expression |
|---|---|
| asinlem | ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) + (√‘(1 − (𝐴↑2)))) ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-icn 11298 | . . . 4 ⊢ i ∈ ℂ | |
| 2 | mulcl 11323 | . . . 4 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ∈ ℂ) |
| 4 | ax-1cn 11297 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 5 | sqcl 14301 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
| 6 | subcl 11595 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → (1 − (𝐴↑2)) ∈ ℂ) | |
| 7 | 4, 5, 6 | sylancr 599 | . . . 4 ⊢ (𝐴 ∈ ℂ → (1 − (𝐴↑2)) ∈ ℂ) |
| 8 | 7 | sqrtcld 15651 | . . 3 ⊢ (𝐴 ∈ ℂ → (√‘(1 − (𝐴↑2))) ∈ ℂ) |
| 9 | 3, 8 | subnegd 11715 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) = ((i · 𝐴) + (√‘(1 − (𝐴↑2))))) |
| 10 | 8 | negcld 11695 | . . 3 ⊢ (𝐴 ∈ ℂ → -(√‘(1 − (𝐴↑2))) ∈ ℂ) |
| 11 | 0ne1 12454 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 12 | 0cnd 11338 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℂ) | |
| 13 | 1cnd 11341 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → 1 ∈ ℂ) | |
| 14 | subcan2 11622 | . . . . . . . 8 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) = (1 − (𝐴↑2)) ↔ 0 = 1)) | |
| 15 | 14 | necon3bid 3003 | . . . . . . 7 ⊢ ((0 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴↑2) ∈ ℂ) → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
| 16 | 12, 13, 5, 15 | syl3anc 1399 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((0 − (𝐴↑2)) ≠ (1 − (𝐴↑2)) ↔ 0 ≠ 1)) |
| 17 | 11, 16 | mpbiri 261 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (0 − (𝐴↑2)) ≠ (1 − (𝐴↑2))) |
| 18 | sqmul 14302 | . . . . . . . 8 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) | |
| 19 | 1, 18 | mpan 703 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = ((i↑2) · (𝐴↑2))) |
| 20 | i2 14386 | . . . . . . . . 9 ⊢ (i↑2) = -1 | |
| 21 | 20 | oveq1i 7461 | . . . . . . . 8 ⊢ ((i↑2) · (𝐴↑2)) = ( -1 · (𝐴↑2)) |
| 22 | 5 | mulm1d 11807 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → ( -1 · (𝐴↑2)) = -(𝐴↑2)) |
| 23 | 21, 22 | eqtrid 2810 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((i↑2) · (𝐴↑2)) = -(𝐴↑2)) |
| 24 | 19, 23 | eqtrd 2798 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = -(𝐴↑2)) |
| 25 | df-neg 11583 | . . . . . 6 ⊢ -(𝐴↑2) = (0 − (𝐴↑2)) | |
| 26 | 24, 25 | eqtrdi 2814 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) = (0 − (𝐴↑2))) |
| 27 | sqneg 14298 | . . . . . . 7 ⊢ ((√‘(1 − (𝐴↑2))) ∈ ℂ → ( -(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) | |
| 28 | 8, 27 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ( -(√‘(1 − (𝐴↑2)))↑2) = ((√‘(1 − (𝐴↑2)))↑2)) |
| 29 | 7 | sqsqrtd 15653 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
| 30 | 28, 29 | eqtrd 2798 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ( -(√‘(1 − (𝐴↑2)))↑2) = (1 − (𝐴↑2))) |
| 31 | 17, 26, 30 | 3netr4d 3036 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴)↑2) ≠ ( -(√‘(1 − (𝐴↑2)))↑2)) |
| 32 | oveq1 7458 | . . . . 5 ⊢ ((i · 𝐴) = -(√‘(1 − (𝐴↑2))) → ((i · 𝐴)↑2) = ( -(√‘(1 − (𝐴↑2)))↑2)) | |
| 33 | 32 | necon3i 2991 | . . . 4 ⊢ (((i · 𝐴)↑2) ≠ ( -(√‘(1 − (𝐴↑2)))↑2) → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
| 34 | 31, 33 | syl 18 | . . 3 ⊢ (𝐴 ∈ ℂ → (i · 𝐴) ≠ -(√‘(1 − (𝐴↑2)))) |
| 35 | 3, 10, 34 | subne0d 11718 | . 2 ⊢ (𝐴 ∈ ℂ → ((i · 𝐴) − -(√‘(1 − (𝐴↑2)))) ≠ 0) |
| 36 | 9, 35 | eqnetrrd 3027 | 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 2147 ≠ wne 2959 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 0cc0 11239 1c1 11240 ici 11241 + caddc 11242 · cmul 11244 − cmin 11580 -cneg 11581 2c2 12437 ↑cexp 14244 √csqrt 15443 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 |
| This theorem is used by: asinlem3 27256 asinf 27257 asinneg 27271 efiasin 27273 asinbnd 27284 dvasin 38890 |
| Copyright terms: Public domain | W3C validator |