| 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 14280 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))) | |
| 5 | 2, 3, 4 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))) |
| 6 | 1, 5 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)) |
| 7 | 6 | ord 878 | . . 3 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐴 = -𝐵)) |
| 8 | simpl 488 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝜑) | |
| 9 | fveq2 6878 | . . . . . . 7 ⊢ (𝐴 = -𝐵 → (ℜ‘𝐴) = (ℜ‘-𝐵)) | |
| 10 | reneg 15212 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℜ‘-𝐵) = -(ℜ‘𝐵)) | |
| 11 | 3, 10 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (ℜ‘-𝐵) = -(ℜ‘𝐵)) |
| 12 | 9, 11 | sylan9eqr 2817 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐴) = -(ℜ‘𝐵)) |
| 13 | sqeqd.4 | . . . . . . . . . . . 12 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐴)) | |
| 14 | 13 | adantr 486 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ (ℜ‘𝐴)) |
| 15 | 14, 12 | breqtrd 5131 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ -(ℜ‘𝐵)) |
| 16 | 3 | adantr 486 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝐵 ∈ ℂ) |
| 17 | recl 15197 | . . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 18 | 16, 17 | syl 18 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) ∈ ℝ) |
| 19 | 18 | le0neg1d 11809 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → ((ℜ‘𝐵) ≤ 0 ↔ 0 ≤ -(ℜ‘𝐵))) |
| 20 | 15, 19 | mpbird 260 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) ≤ 0) |
| 21 | sqeqd.5 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐵)) | |
| 22 | 21 | adantr 486 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ (ℜ‘𝐵)) |
| 23 | 0re 11234 | . . . . . . . . . 10 ⊢ 0 ∈ ℝ | |
| 24 | letri3 11319 | . . . . . . . . . 10 ⊢ (((ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → ((ℜ‘𝐵) = 0 ↔ ((ℜ‘𝐵) ≤ 0 ∧ 0 ≤ (ℜ‘𝐵)))) | |
| 25 | 18, 23, 24 | sylancl 598 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → ((ℜ‘𝐵) = 0 ↔ ((ℜ‘𝐵) ≤ 0 ∧ 0 ≤ (ℜ‘𝐵)))) |
| 26 | 20, 22, 25 | mpbir2and 726 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) = 0) |
| 27 | 26 | negeqd 11475 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → -(ℜ‘𝐵) = -0) |
| 28 | neg0 11528 | . . . . . . 7 ⊢ -0 = 0 | |
| 29 | 27, 28 | eqtrdi 2811 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → -(ℜ‘𝐵) = 0) |
| 30 | 12, 29 | eqtrd 2795 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐴) = 0) |
| 31 | sqeqd.6 | . . . . 5 ⊢ ((𝜑 ∧ (ℜ‘𝐴) = 0 ∧ (ℜ‘𝐵) = 0) → 𝐴 = 𝐵) | |
| 32 | 8, 30, 26, 31 | syl3anc 1398 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝐴 = 𝐵) |
| 33 | 32 | ex 418 | . . 3 ⊢ (𝜑 → (𝐴 = -𝐵 → 𝐴 = 𝐵)) |
| 34 | 7, 33 | syld 48 | . 2 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐴 = 𝐵)) |
| 35 | 34 | pm2.18d 128 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6533 (class class class)co 7413 ℂcc 11122 ℝcr 11123 0cc0 11124 ≤ cle 11268 -cneg 11466 2c2 12319 ↑cexp 14125 ℜcre 15184 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-seq 14066 df-exp 14126 df-cj 15186 df-re 15187 df-im 15188 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |