![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sqeqd | Structured version Visualization version GIF version |
Description: A deduction for showing two numbers whose squares are equal are themselves equal. (Contributed by Mario Carneiro, 3-Apr-2015.) |
Ref | Expression |
---|---|
sqeqd.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
sqeqd.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
sqeqd.3 | ⊢ (𝜑 → (𝐴↑2) = (𝐵↑2)) |
sqeqd.4 | ⊢ (𝜑 → 0 ≤ (ℜ‘𝐴)) |
sqeqd.5 | ⊢ (𝜑 → 0 ≤ (ℜ‘𝐵)) |
sqeqd.6 | ⊢ ((𝜑 ∧ (ℜ‘𝐴) = 0 ∧ (ℜ‘𝐵) = 0) → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
sqeqd | ⊢ (𝜑 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sqeqd.3 | . . . . 5 ⊢ (𝜑 → (𝐴↑2) = (𝐵↑2)) | |
2 | sqeqd.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
3 | sqeqd.2 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
4 | sqeqor 14252 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))) | |
5 | 2, 3, 4 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))) |
6 | 1, 5 | mpbid 232 | . . . 4 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)) |
7 | 6 | ord 864 | . . 3 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐴 = -𝐵)) |
8 | simpl 482 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝜑) | |
9 | fveq2 6907 | . . . . . . 7 ⊢ (𝐴 = -𝐵 → (ℜ‘𝐴) = (ℜ‘-𝐵)) | |
10 | reneg 15161 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℜ‘-𝐵) = -(ℜ‘𝐵)) | |
11 | 3, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (ℜ‘-𝐵) = -(ℜ‘𝐵)) |
12 | 9, 11 | sylan9eqr 2797 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐴) = -(ℜ‘𝐵)) |
13 | sqeqd.4 | . . . . . . . . . . . 12 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐴)) | |
14 | 13 | adantr 480 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ (ℜ‘𝐴)) |
15 | 14, 12 | breqtrd 5174 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ -(ℜ‘𝐵)) |
16 | 3 | adantr 480 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝐵 ∈ ℂ) |
17 | recl 15146 | . . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
18 | 16, 17 | syl 17 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) ∈ ℝ) |
19 | 18 | le0neg1d 11832 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → ((ℜ‘𝐵) ≤ 0 ↔ 0 ≤ -(ℜ‘𝐵))) |
20 | 15, 19 | mpbird 257 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) ≤ 0) |
21 | sqeqd.5 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐵)) | |
22 | 21 | adantr 480 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ (ℜ‘𝐵)) |
23 | 0re 11261 | . . . . . . . . . 10 ⊢ 0 ∈ ℝ | |
24 | letri3 11344 | . . . . . . . . . 10 ⊢ (((ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → ((ℜ‘𝐵) = 0 ↔ ((ℜ‘𝐵) ≤ 0 ∧ 0 ≤ (ℜ‘𝐵)))) | |
25 | 18, 23, 24 | sylancl 586 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → ((ℜ‘𝐵) = 0 ↔ ((ℜ‘𝐵) ≤ 0 ∧ 0 ≤ (ℜ‘𝐵)))) |
26 | 20, 22, 25 | mpbir2and 713 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) = 0) |
27 | 26 | negeqd 11500 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → -(ℜ‘𝐵) = -0) |
28 | neg0 11553 | . . . . . . 7 ⊢ -0 = 0 | |
29 | 27, 28 | eqtrdi 2791 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → -(ℜ‘𝐵) = 0) |
30 | 12, 29 | eqtrd 2775 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐴) = 0) |
31 | sqeqd.6 | . . . . 5 ⊢ ((𝜑 ∧ (ℜ‘𝐴) = 0 ∧ (ℜ‘𝐵) = 0) → 𝐴 = 𝐵) | |
32 | 8, 30, 26, 31 | syl3anc 1370 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝐴 = 𝐵) |
33 | 32 | ex 412 | . . 3 ⊢ (𝜑 → (𝐴 = -𝐵 → 𝐴 = 𝐵)) |
34 | 7, 33 | syld 47 | . 2 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐴 = 𝐵)) |
35 | 34 | pm2.18d 127 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 class class class wbr 5148 ‘cfv 6563 (class class class)co 7431 ℂcc 11151 ℝcr 11152 0cc0 11153 ≤ cle 11294 -cneg 11491 2c2 12319 ↑cexp 14099 ℜcre 15133 |
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 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-n0 12525 df-z 12612 df-uz 12877 df-seq 14040 df-exp 14100 df-cj 15135 df-re 15136 df-im 15137 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |