| 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 15535 | . . 3 ⊢ (𝐵 ∈ ℂ → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
| 3 | reurmo 3368 | . . 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 3062 | . . . 4 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
| 10 | 8, 9 | sylibr 237 | . . 3 ⊢ (𝜑 → (i · 𝐴) ∉ ℝ+) |
| 11 | 6, 7, 10 | 3jca 1146 | . 2 ⊢ (𝜑 → ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) |
| 12 | sqrtcl 15536 | . . 3 ⊢ (𝐵 ∈ ℂ → (√‘𝐵) ∈ ℂ) | |
| 13 | 1, 12 | syl 18 | . 2 ⊢ (𝜑 → (√‘𝐵) ∈ ℂ) |
| 14 | sqrtthlem 15537 | . . 3 ⊢ (𝐵 ∈ ℂ → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 15 | 1, 14 | syl 18 | . 2 ⊢ (𝜑 → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) |
| 16 | oveq1 7429 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥↑2) = (𝐴↑2)) | |
| 17 | 16 | eqeq1d 2762 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥↑2) = 𝐵 ↔ (𝐴↑2) = 𝐵)) |
| 18 | fveq2 6888 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴)) | |
| 19 | 18 | breq2d 5114 | . . . 4 ⊢ (𝑥 = 𝐴 → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘𝐴))) |
| 20 | oveq2 7430 | . . . . 5 ⊢ (𝑥 = 𝐴 → (i · 𝑥) = (i · 𝐴)) | |
| 21 | neleq1 3067 | . . . . 5 ⊢ ((i · 𝑥) = (i · 𝐴) → ((i · 𝑥) ∉ ℝ+ ↔ (i · 𝐴) ∉ ℝ+)) | |
| 22 | 20, 21 | syl 18 | . . . 4 ⊢ (𝑥 = 𝐴 → ((i · 𝑥) ∉ ℝ+ ↔ (i · 𝐴) ∉ ℝ+)) |
| 23 | 17, 19, 22 | 3anbi123d 1464 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+))) |
| 24 | oveq1 7429 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (𝑥↑2) = ((√‘𝐵)↑2)) | |
| 25 | 24 | eqeq1d 2762 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((𝑥↑2) = 𝐵 ↔ ((√‘𝐵)↑2) = 𝐵)) |
| 26 | fveq2 6888 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (ℜ‘𝑥) = (ℜ‘(√‘𝐵))) | |
| 27 | 26 | breq2d 5114 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘(√‘𝐵)))) |
| 28 | oveq2 7430 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (i · 𝑥) = (i · (√‘𝐵))) | |
| 29 | neleq1 3067 | . . . . 5 ⊢ ((i · 𝑥) = (i · (√‘𝐵)) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 30 | 28, 29 | syl 18 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐵)) ∉ ℝ+)) |
| 31 | 25, 27, 30 | 3anbi123d 1464 | . . 3 ⊢ (𝑥 = (√‘𝐵) → (((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+))) |
| 32 | 23, 31 | rmoi 3838 | . 2 ⊢ ((∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ∧ (𝐴 ∈ ℂ ∧ ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) ∧ ((√‘𝐵) ∈ ℂ ∧ (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+))) → 𝐴 = (√‘𝐵)) |
| 33 | 4, 5, 11, 13, 15, 32 | syl122anc 1406 | 1 ⊢ (𝜑 → 𝐴 = (√‘𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∉ wnel 3061 ∃!wreu 3363 ∃*wrmo 3364 class class class wbr 5102 ‘cfv 6541 (class class class)co 7422 ℂcc 11203 0cc0 11205 ici 11207 · cmul 11210 ≤ cle 11349 2c2 12402 ℝ+crp 13125 ↑cexp 14209 ℜcre 15271 √csqrt 15407 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-er 8722 df-en 8979 df-dom 8980 df-sdom 8981 df-sup 9439 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-2 12410 df-3 12411 df-n0 12612 df-z 12699 df-uz 12971 df-rp 13126 df-seq 14150 df-exp 14210 df-cj 15273 df-re 15274 df-im 15275 df-sqrt 15409 df-abs 15410 |
| This theorem is used by: eqsqrt2d 15543 cphsqrtcl2 25514 constrsqrtcl 34459 sqrtcval 44748 |
| Copyright terms: Public domain | W3C validator |