| 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 15414 | . . 3 ⊢ (𝐵 ∈ ℂ → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
| 3 | reurmo 3379 | . . 3 ⊢ (∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
| 4 | 1, 2, 3 | 3syl 19 | . 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 3071 | . . . 4 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
| 10 | 8, 9 | sylibr 237 | . . 3 ⊢ (𝜑 → (i · 𝐴) ∉ ℝ+) |
| 11 | 6, 7, 10 | 3jca 1144 | . 2 ⊢ (𝜑 → ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) |
| 12 | sqrtcl 15415 | . . 3 ⊢ (𝐵 ∈ ℂ → (√‘𝐵) ∈ ℂ) | |
| 13 | 1, 12 | syl 18 | . 2 ⊢ (𝜑 → (√‘𝐵) ∈ ℂ) |
| 14 | sqrtthlem 15416 | . . 3 ⊢ (𝐵 ∈ ℂ → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 15 | 1, 14 | syl 18 | . 2 ⊢ (𝜑 → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) |
| 16 | oveq1 7420 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥↑2) = (𝐴↑2)) | |
| 17 | 16 | eqeq1d 2771 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥↑2) = 𝐵 ↔ (𝐴↑2) = 𝐵)) |
| 18 | fveq2 6884 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴)) | |
| 19 | 18 | breq2d 5125 | . . . 4 ⊢ (𝑥 = 𝐴 → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘𝐴))) |
| 20 | oveq2 7421 | . . . . 5 ⊢ (𝑥 = 𝐴 → (i · 𝑥) = (i · 𝐴)) | |
| 21 | neleq1 3076 | . . . . 5 ⊢ ((i · 𝑥) = (i · 𝐴) → ((i · 𝑥) ∉ ℝ+ ↔ (i · 𝐴) ∉ ℝ+)) | |
| 22 | 20, 21 | syl 18 | . . . 4 ⊢ (𝑥 = 𝐴 → ((i · 𝑥) ∉ ℝ+ ↔ (i · 𝐴) ∉ ℝ+)) |
| 23 | 17, 19, 22 | 3anbi123d 1462 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+))) |
| 24 | oveq1 7420 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (𝑥↑2) = ((√‘𝐵)↑2)) | |
| 25 | 24 | eqeq1d 2771 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((𝑥↑2) = 𝐵 ↔ ((√‘𝐵)↑2) = 𝐵)) |
| 26 | fveq2 6884 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (ℜ‘𝑥) = (ℜ‘(√‘𝐵))) | |
| 27 | 26 | breq2d 5125 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘(√‘𝐵)))) |
| 28 | oveq2 7421 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (i · 𝑥) = (i · (√‘𝐵))) | |
| 29 | neleq1 3076 | . . . . 5 ⊢ ((i · 𝑥) = (i · (√‘𝐵)) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 30 | 28, 29 | syl 18 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐵)) ∉ ℝ+)) |
| 31 | 25, 27, 30 | 3anbi123d 1462 | . . 3 ⊢ (𝑥 = (√‘𝐵) → (((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+))) |
| 32 | 23, 31 | rmoi 3853 | . 2 ⊢ ((∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ∧ (𝐴 ∈ ℂ ∧ ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) ∧ ((√‘𝐵) ∈ ℂ ∧ (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+))) → 𝐴 = (√‘𝐵)) |
| 33 | 4, 5, 11, 13, 15, 32 | syl122anc 1404 | 1 ⊢ (𝜑 → 𝐴 = (√‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∉ wnel 3070 ∃!wreu 3374 ∃*wrmo 3375 class class class wbr 5113 ‘cfv 6539 (class class class)co 7413 ℂcc 11100 0cc0 11102 ici 11104 · cmul 11107 ≤ cle 11246 2c2 12297 ℝ+crp 13018 ↑cexp 14099 ℜcre 15150 √csqrt 15286 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5273 ax-pow 5339 ax-pr 5407 ax-un 7735 ax-cnex 11158 ax-resscn 11159 ax-1cn 11160 ax-icn 11161 ax-addcl 11162 ax-addrcl 11163 ax-mulcl 11164 ax-mulrcl 11165 ax-mulcom 11166 ax-addass 11167 ax-mulass 11168 ax-distr 11169 ax-i2m1 11170 ax-1ne0 11171 ax-1rid 11172 ax-rnegex 11173 ax-rrecex 11174 ax-cnre 11175 ax-pre-lttri 11176 ax-pre-lttrn 11177 ax-pre-ltadd 11178 ax-pre-mulgt0 11179 ax-pre-sup 11180 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6305 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-sup 9404 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11445 df-neg 11446 df-div 11874 df-nn 12236 df-2 12305 df-3 12306 df-n0 12507 df-z 12594 df-uz 12865 df-rp 13019 df-seq 14040 df-exp 14100 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 |
| This theorem is referenced by: eqsqrt2d 15422 cphsqrtcl2 25316 constrsqrtcl 34116 sqrtcval 44296 |
| Copyright terms: Public domain | W3C validator |