| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqsqrtd | Structured version Visualization version GIF version | ||
| Description: A deduction for showing that a number equals the square root of another. (Contributed by Mario Carneiro, 3-Apr-2015.) |
| Ref | Expression |
|---|---|
| eqsqrtd.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| eqsqrtd.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| eqsqrtd.3 | ⊢ (𝜑 → (𝐴↑2) = 𝐵) |
| eqsqrtd.4 | ⊢ (𝜑 → 0 ≤ (ℜ‘𝐴)) |
| eqsqrtd.5 | ⊢ (𝜑 → ¬ (i · 𝐴) ∈ ℝ+) |
| Ref | Expression |
|---|---|
| eqsqrtd | ⊢ (𝜑 → 𝐴 = (√‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqsqrtd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 2 | sqreu 15268 | . . 3 ⊢ (𝐵 ∈ ℂ → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
| 3 | reurmo 3346 | . . 3 ⊢ (∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
| 4 | 1, 2, 3 | 3syl 18 | . 2 ⊢ (𝜑 → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
| 5 | eqsqrtd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 6 | eqsqrtd.3 | . . 3 ⊢ (𝜑 → (𝐴↑2) = 𝐵) | |
| 7 | eqsqrtd.4 | . . 3 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐴)) | |
| 8 | eqsqrtd.5 | . . . 4 ⊢ (𝜑 → ¬ (i · 𝐴) ∈ ℝ+) | |
| 9 | df-nel 3030 | . . . 4 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
| 10 | 8, 9 | sylibr 234 | . . 3 ⊢ (𝜑 → (i · 𝐴) ∉ ℝ+) |
| 11 | 6, 7, 10 | 3jca 1128 | . 2 ⊢ (𝜑 → ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) |
| 12 | sqrtcl 15269 | . . 3 ⊢ (𝐵 ∈ ℂ → (√‘𝐵) ∈ ℂ) | |
| 13 | 1, 12 | syl 17 | . 2 ⊢ (𝜑 → (√‘𝐵) ∈ ℂ) |
| 14 | sqrtthlem 15270 | . . 3 ⊢ (𝐵 ∈ ℂ → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 15 | 1, 14 | syl 17 | . 2 ⊢ (𝜑 → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) |
| 16 | oveq1 7356 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥↑2) = (𝐴↑2)) | |
| 17 | 16 | eqeq1d 2731 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥↑2) = 𝐵 ↔ (𝐴↑2) = 𝐵)) |
| 18 | fveq2 6822 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴)) | |
| 19 | 18 | breq2d 5104 | . . . 4 ⊢ (𝑥 = 𝐴 → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘𝐴))) |
| 20 | oveq2 7357 | . . . . 5 ⊢ (𝑥 = 𝐴 → (i · 𝑥) = (i · 𝐴)) | |
| 21 | neleq1 3035 | . . . . 5 ⊢ ((i · 𝑥) = (i · 𝐴) → ((i · 𝑥) ∉ ℝ+ ↔ (i · 𝐴) ∉ ℝ+)) | |
| 22 | 20, 21 | syl 17 | . . . 4 ⊢ (𝑥 = 𝐴 → ((i · 𝑥) ∉ ℝ+ ↔ (i · 𝐴) ∉ ℝ+)) |
| 23 | 17, 19, 22 | 3anbi123d 1438 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+))) |
| 24 | oveq1 7356 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (𝑥↑2) = ((√‘𝐵)↑2)) | |
| 25 | 24 | eqeq1d 2731 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((𝑥↑2) = 𝐵 ↔ ((√‘𝐵)↑2) = 𝐵)) |
| 26 | fveq2 6822 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (ℜ‘𝑥) = (ℜ‘(√‘𝐵))) | |
| 27 | 26 | breq2d 5104 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘(√‘𝐵)))) |
| 28 | oveq2 7357 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (i · 𝑥) = (i · (√‘𝐵))) | |
| 29 | neleq1 3035 | . . . . 5 ⊢ ((i · 𝑥) = (i · (√‘𝐵)) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 30 | 28, 29 | syl 17 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐵)) ∉ ℝ+)) |
| 31 | 25, 27, 30 | 3anbi123d 1438 | . . 3 ⊢ (𝑥 = (√‘𝐵) → (((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+))) |
| 32 | 23, 31 | rmoi 3843 | . 2 ⊢ ((∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ∧ (𝐴 ∈ ℂ ∧ ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) ∧ ((√‘𝐵) ∈ ℂ ∧ (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+))) → 𝐴 = (√‘𝐵)) |
| 33 | 4, 5, 11, 13, 15, 32 | syl122anc 1381 | 1 ⊢ (𝜑 → 𝐴 = (√‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∉ wnel 3029 ∃!wreu 3341 ∃*wrmo 3342 class class class wbr 5092 ‘cfv 6482 (class class class)co 7349 ℂcc 11007 0cc0 11009 ici 11011 · cmul 11014 ≤ cle 11150 2c2 12183 ℝ+crp 12893 ↑cexp 13968 ℜcre 15004 √csqrt 15140 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-pre-sup 11087 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-sup 9332 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-2 12191 df-3 12192 df-n0 12385 df-z 12472 df-uz 12736 df-rp 12894 df-seq 13909 df-exp 13969 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 |
| This theorem is referenced by: eqsqrt2d 15276 cphsqrtcl2 25084 constrsqrtcl 33746 sqrtcval 43618 |
| Copyright terms: Public domain | W3C validator |