| 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 14223 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))) | |
| 5 | 2, 3, 4 | syl2anc 593 | . . . . 5 ⊢ (𝜑 → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))) |
| 6 | 1, 5 | mpbid 234 | . . . 4 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)) |
| 7 | 6 | ord 875 | . . 3 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐴 = -𝐵)) |
| 8 | simpl 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝜑) | |
| 9 | fveq2 6862 | . . . . . . 7 ⊢ (𝐴 = -𝐵 → (ℜ‘𝐴) = (ℜ‘-𝐵)) | |
| 10 | reneg 15143 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (ℜ‘-𝐵) = -(ℜ‘𝐵)) | |
| 11 | 3, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (ℜ‘-𝐵) = -(ℜ‘𝐵)) |
| 12 | 9, 11 | sylan9eqr 2818 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐴) = -(ℜ‘𝐵)) |
| 13 | sqeqd.4 | . . . . . . . . . . . 12 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐴)) | |
| 14 | 13 | adantr 484 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ (ℜ‘𝐴)) |
| 15 | 14, 12 | breqtrd 5123 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ -(ℜ‘𝐵)) |
| 16 | 3 | adantr 484 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝐵 ∈ ℂ) |
| 17 | recl 15128 | . . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℂ → (ℜ‘𝐵) ∈ ℝ) | |
| 18 | 16, 17 | syl 17 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) ∈ ℝ) |
| 19 | 18 | le0neg1d 11752 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → ((ℜ‘𝐵) ≤ 0 ↔ 0 ≤ -(ℜ‘𝐵))) |
| 20 | 15, 19 | mpbird 259 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) ≤ 0) |
| 21 | sqeqd.5 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ (ℜ‘𝐵)) | |
| 22 | 21 | adantr 484 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 0 ≤ (ℜ‘𝐵)) |
| 23 | 0re 11177 | . . . . . . . . . 10 ⊢ 0 ∈ ℝ | |
| 24 | letri3 11262 | . . . . . . . . . 10 ⊢ (((ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → ((ℜ‘𝐵) = 0 ↔ ((ℜ‘𝐵) ≤ 0 ∧ 0 ≤ (ℜ‘𝐵)))) | |
| 25 | 18, 23, 24 | sylancl 595 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → ((ℜ‘𝐵) = 0 ↔ ((ℜ‘𝐵) ≤ 0 ∧ 0 ≤ (ℜ‘𝐵)))) |
| 26 | 20, 22, 25 | mpbir2and 723 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐵) = 0) |
| 27 | 26 | negeqd 11418 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → -(ℜ‘𝐵) = -0) |
| 28 | neg0 11471 | . . . . . . 7 ⊢ -0 = 0 | |
| 29 | 27, 28 | eqtrdi 2812 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → -(ℜ‘𝐵) = 0) |
| 30 | 12, 29 | eqtrd 2796 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → (ℜ‘𝐴) = 0) |
| 31 | sqeqd.6 | . . . . 5 ⊢ ((𝜑 ∧ (ℜ‘𝐴) = 0 ∧ (ℜ‘𝐵) = 0) → 𝐴 = 𝐵) | |
| 32 | 8, 30, 26, 31 | syl3anc 1389 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = -𝐵) → 𝐴 = 𝐵) |
| 33 | 32 | ex 416 | . . 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 208 ∧ wa 399 ∨ wo 858 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 class class class wbr 5097 ‘cfv 6516 (class class class)co 7391 ℂcc 11065 ℝcr 11066 0cc0 11067 ≤ cle 11211 -cneg 11409 2c2 12266 ↑cexp 14068 ℜcre 15115 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-n0 12476 df-z 12563 df-uz 12834 df-seq 14009 df-exp 14069 df-cj 15117 df-re 15118 df-im 15119 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |