| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sq01 | Structured version Visualization version GIF version | ||
| Description: If a complex number equals its square, it must be 0 or 1. (Contributed by NM, 6-Jun-2006.) |
| Ref | Expression |
|---|---|
| sq01 | ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) = 𝐴 ↔ (𝐴 = 0 ∨ 𝐴 = 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 2965 | . . . . 5 ⊢ (𝐴 ≠ 0 ↔ ¬ 𝐴 = 0) | |
| 2 | sqval 14146 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴)) | |
| 3 | mulrid 11202 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ ℂ → (𝐴 · 1) = 𝐴) | |
| 4 | 3 | eqcomd 2775 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℂ → 𝐴 = (𝐴 · 1)) |
| 5 | 2, 4 | eqeq12d 2785 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) = 𝐴 ↔ (𝐴 · 𝐴) = (𝐴 · 1))) |
| 6 | 5 | adantr 485 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → ((𝐴↑2) = 𝐴 ↔ (𝐴 · 𝐴) = (𝐴 · 1))) |
| 7 | ax-1cn 11154 | . . . . . . . . . 10 ⊢ 1 ∈ ℂ | |
| 8 | mulcan 11847 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0)) → ((𝐴 · 𝐴) = (𝐴 · 1) ↔ 𝐴 = 1)) | |
| 9 | 7, 8 | mp3an2 1475 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0)) → ((𝐴 · 𝐴) = (𝐴 · 1) ↔ 𝐴 = 1)) |
| 10 | 9 | anabss5 680 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → ((𝐴 · 𝐴) = (𝐴 · 1) ↔ 𝐴 = 1)) |
| 11 | 6, 10 | bitrd 282 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → ((𝐴↑2) = 𝐴 ↔ 𝐴 = 1)) |
| 12 | 11 | biimpd 232 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → ((𝐴↑2) = 𝐴 → 𝐴 = 1)) |
| 13 | 12 | impancom 456 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴↑2) = 𝐴) → (𝐴 ≠ 0 → 𝐴 = 1)) |
| 14 | 1, 13 | biimtrrid 246 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴↑2) = 𝐴) → (¬ 𝐴 = 0 → 𝐴 = 1)) |
| 15 | 14 | orrd 876 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴↑2) = 𝐴) → (𝐴 = 0 ∨ 𝐴 = 1)) |
| 16 | 15 | ex 417 | . 2 ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) = 𝐴 → (𝐴 = 0 ∨ 𝐴 = 1))) |
| 17 | sq0 14224 | . . . 4 ⊢ (0↑2) = 0 | |
| 18 | oveq1 7415 | . . . 4 ⊢ (𝐴 = 0 → (𝐴↑2) = (0↑2)) | |
| 19 | id 23 | . . . 4 ⊢ (𝐴 = 0 → 𝐴 = 0) | |
| 20 | 17, 18, 19 | 3eqtr4a 2830 | . . 3 ⊢ (𝐴 = 0 → (𝐴↑2) = 𝐴) |
| 21 | sq1 14227 | . . . 4 ⊢ (1↑2) = 1 | |
| 22 | oveq1 7415 | . . . 4 ⊢ (𝐴 = 1 → (𝐴↑2) = (1↑2)) | |
| 23 | id 23 | . . . 4 ⊢ (𝐴 = 1 → 𝐴 = 1) | |
| 24 | 21, 22, 23 | 3eqtr4a 2830 | . . 3 ⊢ (𝐴 = 1 → (𝐴↑2) = 𝐴) |
| 25 | 20, 24 | jaoi 870 | . 2 ⊢ ((𝐴 = 0 ∨ 𝐴 = 1) → (𝐴↑2) = 𝐴) |
| 26 | 16, 25 | impbid1 228 | 1 ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) = 𝐴 ↔ (𝐴 = 0 ∨ 𝐴 = 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 (class class class)co 7408 ℂcc 11094 0cc0 11096 1c1 11097 · cmul 11101 2c2 12291 ↑cexp 14093 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-n0 12501 df-z 12588 df-uz 12859 df-seq 14034 df-exp 14094 |
| This theorem is referenced by: cphsubrglem 25301 |
| Copyright terms: Public domain | W3C validator |