Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > resqreu | Structured version Visualization version GIF version |
Description: Existence and uniqueness for the real square root function. (Contributed by Mario Carneiro, 9-Jul-2013.) |
Ref | Expression |
---|---|
resqreu | ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resqrex 14610 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ∃𝑥 ∈ ℝ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) | |
2 | recn 10627 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
3 | 2 | adantr 483 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) → 𝑥 ∈ ℂ) |
4 | simprr 771 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) → (𝑥↑2) = 𝐴) | |
5 | rere 14481 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → (ℜ‘𝑥) = 𝑥) | |
6 | 5 | breq2d 5078 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ 𝑥)) |
7 | 6 | biimpar 480 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 0 ≤ 𝑥) → 0 ≤ (ℜ‘𝑥)) |
8 | 7 | adantrr 715 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) → 0 ≤ (ℜ‘𝑥)) |
9 | rennim 14598 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (i · 𝑥) ∉ ℝ+) | |
10 | 9 | adantr 483 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) → (i · 𝑥) ∉ ℝ+) |
11 | 4, 8, 10 | 3jca 1124 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) → ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
12 | 3, 11 | jca 514 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴)) → (𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+))) |
13 | 12 | reximi2 3244 | . . 3 ⊢ (∃𝑥 ∈ ℝ (0 ≤ 𝑥 ∧ (𝑥↑2) = 𝐴) → ∃𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
14 | 1, 13 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ∃𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
15 | recn 10627 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
16 | 15 | adantr 483 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℂ) |
17 | sqrmo 14611 | . . 3 ⊢ (𝐴 ∈ ℂ → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) | |
18 | 16, 17 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
19 | reu5 3430 | . 2 ⊢ (∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ↔ (∃𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+) ∧ ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+))) | |
20 | 14, 18, 19 | sylanbrc 585 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ∃!𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ+)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∉ wnel 3123 ∃wrex 3139 ∃!wreu 3140 ∃*wrmo 3141 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 ℂcc 10535 ℝcr 10536 0cc0 10537 ici 10539 · cmul 10542 ≤ cle 10676 2c2 11693 ℝ+crp 12390 ↑cexp 13430 ℜcre 14456 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-seq 13371 df-exp 13431 df-cj 14458 df-re 14459 df-im 14460 |
This theorem is referenced by: resqrtcl 14613 resqrtthlem 14614 |
Copyright terms: Public domain | W3C validator |