| 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 15521 | . . 3 ⊢ (𝐵 ∈ ℂ → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
| 3 | reurmo 3369 | . . 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 3063 | . . . 4 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
| 10 | 8, 9 | sylibr 237 | . . 3 ⊢ (𝜑 → (i · 𝐴) ∉ ℝ+) |
| 11 | 6, 7, 10 | 3jca 1146 | . 2 ⊢ (𝜑 → ((𝐴↑2) = 𝐵 ∧ 0 ≤ (ℜ‘𝐴) ∧ (i · 𝐴) ∉ ℝ+)) |
| 12 | sqrtcl 15522 | . . 3 ⊢ (𝐵 ∈ ℂ → (√‘𝐵) ∈ ℂ) | |
| 13 | 1, 12 | syl 18 | . 2 ⊢ (𝜑 → (√‘𝐵) ∈ ℂ) |
| 14 | sqrtthlem 15523 | . . 3 ⊢ (𝐵 ∈ ℂ → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) | |
| 15 | 1, 14 | syl 18 | . 2 ⊢ (𝜑 → (((√‘𝐵)↑2) = 𝐵 ∧ 0 ≤ (ℜ‘(√‘𝐵)) ∧ (i · (√‘𝐵)) ∉ ℝ+)) |
| 16 | oveq1 7425 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥↑2) = (𝐴↑2)) | |
| 17 | 16 | eqeq1d 2763 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥↑2) = 𝐵 ↔ (𝐴↑2) = 𝐵)) |
| 18 | fveq2 6883 | . . . . 5 ⊢ (𝑥 = 𝐴 → (ℜ‘𝑥) = (ℜ‘𝐴)) | |
| 19 | 18 | breq2d 5115 | . . . 4 ⊢ (𝑥 = 𝐴 → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘𝐴))) |
| 20 | oveq2 7426 | . . . . 5 ⊢ (𝑥 = 𝐴 → (i · 𝑥) = (i · 𝐴)) | |
| 21 | neleq1 3068 | . . . . 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 7425 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (𝑥↑2) = ((√‘𝐵)↑2)) | |
| 25 | 24 | eqeq1d 2763 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → ((𝑥↑2) = 𝐵 ↔ ((√‘𝐵)↑2) = 𝐵)) |
| 26 | fveq2 6883 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (ℜ‘𝑥) = (ℜ‘(√‘𝐵))) | |
| 27 | 26 | breq2d 5115 | . . . 4 ⊢ (𝑥 = (√‘𝐵) → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘(√‘𝐵)))) |
| 28 | oveq2 7426 | . . . . 5 ⊢ (𝑥 = (√‘𝐵) → (i · 𝑥) = (i · (√‘𝐵))) | |
| 29 | neleq1 3068 | . . . . 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 1570 ∈ wcel 2145 ∉ wnel 3062 ∃!wreu 3364 ∃*wrmo 3365 class class class wbr 5103 ‘cfv 6537 (class class class)co 7418 ℂcc 11191 0cc0 11193 ici 11195 · cmul 11198 ≤ cle 11337 2c2 12390 ℝ+crp 13113 ↑cexp 14197 ℜcre 15257 √csqrt 15393 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-sup 9427 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 |
| This theorem is used by: eqsqrt2d 15529 cphsqrtcl2 25500 constrsqrtcl 34404 sqrtcval 44626 |
| Copyright terms: Public domain | W3C validator |