Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > resqrtthlem | Structured version Visualization version GIF version |
Description: Lemma for resqrtth 14614. (Contributed by Mario Carneiro, 9-Jul-2013.) |
Ref | Expression |
---|---|
resqrtthlem | ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (((√‘𝐴)↑2) = 𝐴 ∧ 0 ≤ (ℜ‘(√‘𝐴)) ∧ (i · (√‘𝐴)) ∉ ℝ+)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | recn 10626 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
2 | sqrtval 14595 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (√‘𝐴) = (℩𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+))) | |
3 | 2 | eqcomd 2827 | . . . 4 ⊢ (𝐴 ∈ ℂ → (℩𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) = (√‘𝐴)) |
4 | 1, 3 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℝ → (℩𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) = (√‘𝐴)) |
5 | 4 | adantr 483 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (℩𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) = (√‘𝐴)) |
6 | resqrtcl 14612 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (√‘𝐴) ∈ ℝ) | |
7 | 6 | recnd 10668 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (√‘𝐴) ∈ ℂ) |
8 | resqreu 14611 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
9 | oveq1 7162 | . . . . . 6 ⊢ (𝑥 = (√‘𝐴) → (𝑥↑2) = ((√‘𝐴)↑2)) | |
10 | 9 | eqeq1d 2823 | . . . . 5 ⊢ (𝑥 = (√‘𝐴) → ((𝑥↑2) = 𝐴 ↔ ((√‘𝐴)↑2) = 𝐴)) |
11 | fveq2 6669 | . . . . . 6 ⊢ (𝑥 = (√‘𝐴) → (ℜ‘𝑥) = (ℜ‘(√‘𝐴))) | |
12 | 11 | breq2d 5077 | . . . . 5 ⊢ (𝑥 = (√‘𝐴) → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘(√‘𝐴)))) |
13 | oveq2 7163 | . . . . . 6 ⊢ (𝑥 = (√‘𝐴) → (i · 𝑥) = (i · (√‘𝐴))) | |
14 | neleq1 3128 | . . . . . 6 ⊢ ((i · 𝑥) = (i · (√‘𝐴)) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐴)) ∉ ℝ+)) | |
15 | 13, 14 | syl 17 | . . . . 5 ⊢ (𝑥 = (√‘𝐴) → ((i · 𝑥) ∉ ℝ+ ↔ (i · (√‘𝐴)) ∉ ℝ+)) |
16 | 10, 12, 15 | 3anbi123d 1432 | . . . 4 ⊢ (𝑥 = (√‘𝐴) → (((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ (((√‘𝐴)↑2) = 𝐴 ∧ 0 ≤ (ℜ‘(√‘𝐴)) ∧ (i · (√‘𝐴)) ∉ ℝ+))) |
17 | 16 | riota2 7138 | . . 3 ⊢ (((√‘𝐴) ∈ ℂ ∧ ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) → ((((√‘𝐴)↑2) = 𝐴 ∧ 0 ≤ (ℜ‘(√‘𝐴)) ∧ (i · (√‘𝐴)) ∉ ℝ+) ↔ (℩𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) = (√‘𝐴))) |
18 | 7, 8, 17 | syl2anc 586 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((((√‘𝐴)↑2) = 𝐴 ∧ 0 ≤ (ℜ‘(√‘𝐴)) ∧ (i · (√‘𝐴)) ∉ ℝ+) ↔ (℩𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) = (√‘𝐴))) |
19 | 5, 18 | mpbird 259 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (((√‘𝐴)↑2) = 𝐴 ∧ 0 ≤ (ℜ‘(√‘𝐴)) ∧ (i · (√‘𝐴)) ∉ ℝ+)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∉ wnel 3123 ∃!wreu 3140 class class class wbr 5065 ‘cfv 6354 ℩crio 7112 (class class class)co 7155 ℂcc 10534 ℝcr 10535 0cc0 10536 ici 10538 · cmul 10541 ≤ cle 10675 2c2 11691 ℝ+crp 12388 ↑cexp 13428 ℜcre 14455 √csqrt 14591 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-sup 8905 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-nn 11638 df-2 11699 df-3 11700 df-n0 11897 df-z 11981 df-uz 12243 df-rp 12389 df-seq 13369 df-exp 13429 df-cj 14457 df-re 14458 df-im 14459 df-sqrt 14593 |
This theorem is referenced by: resqrtth 14614 sqrtge0 14616 |
Copyright terms: Public domain | W3C validator |