sqrmo - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > sqrmo		Structured version Visualization version GIF version

Theorem sqrmo 15204

Description: Uniqueness for the square root function. (Contributed by Mario Carneiro, 9-Jul-2013.) (Revised by NM, 17-Jun-2017.)

**Assertion**
Ref	Expression
sqrmo	⊢ (𝐴 ∈ ℂ → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺))

Distinct variable group: 𝑥,𝐴

Proof of Theorem sqrmo Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr1 1213	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (𝑥↑2) = 𝐴)
2		simprr1 1219	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (𝑦↑2) = 𝐴)
3	1, 2	eqtr4d 2773	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (𝑥↑2) = (𝑦↑2))
4		sqeqor 14186	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑥↑2) = (𝑦↑2) ↔ (𝑥 = 𝑦 ∨ 𝑥 = -𝑦)))
5	4	ad2ant2r 743	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → ((𝑥↑2) = (𝑦↑2) ↔ (𝑥 = 𝑦 ∨ 𝑥 = -𝑦)))
6	3, 5	mpbid 231	. . . . . . . . . 10 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (𝑥 = 𝑦 ∨ 𝑥 = -𝑦))
7	6	ord 860	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (¬ 𝑥 = 𝑦 → 𝑥 = -𝑦))
8		3simpc 1148	. . . . . . . . . . 11 ⊢ (((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) → (0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺))
9		fveq2 6892	. . . . . . . . . . . . 13 ⊢ (𝑥 = -𝑦 → (ℜ‘𝑥) = (ℜ‘-𝑦))
10	9	breq2d 5161	. . . . . . . . . . . 12 ⊢ (𝑥 = -𝑦 → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘-𝑦)))
11		oveq2 7421	. . . . . . . . . . . . 13 ⊢ (𝑥 = -𝑦 → (i · 𝑥) = (i · -𝑦))
12		neleq1 3050	. . . . . . . . . . . . 13 ⊢ ((i · 𝑥) = (i · -𝑦) → ((i · 𝑥) ∉ ℝ⁺ ↔ (i · -𝑦) ∉ ℝ⁺))
13	11, 12	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 = -𝑦 → ((i · 𝑥) ∉ ℝ⁺ ↔ (i · -𝑦) ∉ ℝ⁺))
14	10, 13	anbi12d 629	. . . . . . . . . . 11 ⊢ (𝑥 = -𝑦 → ((0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ↔ (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
15	8, 14	syl5ibcom 244	. . . . . . . . . 10 ⊢ (((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) → (𝑥 = -𝑦 → (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
16	15	ad2antlr 723	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (𝑥 = -𝑦 → (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
17	7, 16	syld 47	. . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (¬ 𝑥 = 𝑦 → (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
18		negeq 11458	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 0 → -𝑦 = -0)
19		neg0 11512	. . . . . . . . . . . . . . 15 ⊢ -0 = 0
20	18, 19	eqtrdi 2786	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 0 → -𝑦 = 0)
21	20	eqeq2d 2741	. . . . . . . . . . . . 13 ⊢ (𝑦 = 0 → (𝑥 = -𝑦 ↔ 𝑥 = 0))
22		eqeq2 2742	. . . . . . . . . . . . 13 ⊢ (𝑦 = 0 → (𝑥 = 𝑦 ↔ 𝑥 = 0))
23	21, 22	bitr4d 281	. . . . . . . . . . . 12 ⊢ (𝑦 = 0 → (𝑥 = -𝑦 ↔ 𝑥 = 𝑦))
24	23	biimpcd 248	. . . . . . . . . . 11 ⊢ (𝑥 = -𝑦 → (𝑦 = 0 → 𝑥 = 𝑦))
25	24	necon3bd 2952	. . . . . . . . . 10 ⊢ (𝑥 = -𝑦 → (¬ 𝑥 = 𝑦 → 𝑦 ≠ 0))
26	7, 25	syli 39	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (¬ 𝑥 = 𝑦 → 𝑦 ≠ 0))
27		3simpc 1148	. . . . . . . . . . . 12 ⊢ (((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺) → (0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))
28		cnpart 15193	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 0) → ((0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺) ↔ ¬ (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
29	27, 28	imbitrid 243	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 0) → (((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺) → ¬ (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
30	29	impancom 450	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺)) → (𝑦 ≠ 0 → ¬ (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
31	30	adantl 480	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (𝑦 ≠ 0 → ¬ (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
32	26, 31	syld 47	. . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → (¬ 𝑥 = 𝑦 → ¬ (0 ≤ (ℜ‘-𝑦) ∧ (i · -𝑦) ∉ ℝ⁺)))
33	17, 32	pm2.65d 195	. . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → ¬ ¬ 𝑥 = 𝑦)
34	33	notnotrd 133	. . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺)) ∧ (𝑦 ∈ ℂ ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → 𝑥 = 𝑦)
35	34	an4s 656	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ (((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺))) → 𝑥 = 𝑦)
36	35	ex 411	. . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺)) → 𝑥 = 𝑦))
37	36	a1i 11	. . 3 ⊢ (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺)) → 𝑥 = 𝑦)))
38	37	ralrimivv 3196	. 2 ⊢ (𝐴 ∈ ℂ → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℂ ((((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺)) → 𝑥 = 𝑦))
39		oveq1 7420	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥↑2) = (𝑦↑2))
40	39	eqeq1d 2732	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥↑2) = 𝐴 ↔ (𝑦↑2) = 𝐴))
41		fveq2 6892	. . . . 5 ⊢ (𝑥 = 𝑦 → (ℜ‘𝑥) = (ℜ‘𝑦))
42	41	breq2d 5161	. . . 4 ⊢ (𝑥 = 𝑦 → (0 ≤ (ℜ‘𝑥) ↔ 0 ≤ (ℜ‘𝑦)))
43		oveq2 7421	. . . . 5 ⊢ (𝑥 = 𝑦 → (i · 𝑥) = (i · 𝑦))
44		neleq1 3050	. . . . 5 ⊢ ((i · 𝑥) = (i · 𝑦) → ((i · 𝑥) ∉ ℝ⁺ ↔ (i · 𝑦) ∉ ℝ⁺))
45	43, 44	syl 17	. . . 4 ⊢ (𝑥 = 𝑦 → ((i · 𝑥) ∉ ℝ⁺ ↔ (i · 𝑦) ∉ ℝ⁺))
46	40, 42, 45	3anbi123d 1434	. . 3 ⊢ (𝑥 = 𝑦 → (((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ↔ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺)))
47	46	rmo4 3727	. 2 ⊢ (∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℂ ((((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺) ∧ ((𝑦↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑦) ∧ (i · 𝑦) ∉ ℝ⁺)) → 𝑥 = 𝑦))
48	38, 47	sylibr 233	1 ⊢ (𝐴 ∈ ℂ → ∃*𝑥 ∈ ℂ ((𝑥↑2) = 𝐴 ∧ 0 ≤ (ℜ‘𝑥) ∧ (i · 𝑥) ∉ ℝ⁺))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∉ wnel 3044 ∀wral 3059 ∃*wrmo 3373 class class class wbr 5149 ‘cfv 6544 (class class class)co 7413 ℂcc 11112 0cc0 11114 ici 11116 · cmul 11119 ≤ cle 11255 -cneg 11451 2c2 12273 ℝ⁺crp 12980 ↑cexp 14033 ℜcre 15050

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-2nd 7980 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-er 8707 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-div 11878 df-nn 12219 df-2 12281 df-n0 12479 df-z 12565 df-uz 12829 df-rp 12981 df-seq 13973 df-exp 14034 df-cj 15052 df-re 15053 df-im 15054

This theorem is referenced by: resqreu 15205 sqrtneg 15220 sqreu 15313

W3C validator