| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ipiiie0 | Structured version Visualization version GIF version | ||
| Description: The multiplicative inverse of i (per i4 14348) is also its additive inverse. (Contributed by SN, 30-Jun-2024.) |
| Ref | Expression |
|---|---|
| ipiiie0 | ⊢ (i + (i · (i · i))) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sn-it1ei 43489 | . . . 4 ⊢ (i · 1) = i | |
| 2 | 1 | eqcomi 2769 | . . 3 ⊢ i = (i · 1) |
| 3 | reixi 43475 | . . . 4 ⊢ (i · i) = (0 −ℝ 1) | |
| 4 | 3 | oveq2i 7431 | . . 3 ⊢ (i · (i · i)) = (i · (0 −ℝ 1)) |
| 5 | 2, 4 | oveq12i 7432 | . 2 ⊢ (i + (i · (i · i))) = ((i · 1) + (i · (0 −ℝ 1))) |
| 6 | ax-icn 11259 | . . 3 ⊢ i ∈ ℂ | |
| 7 | ax-1cn 11258 | . . 3 ⊢ 1 ∈ ℂ | |
| 8 | 1re 11308 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 9 | rernegcl 43423 | . . . . 5 ⊢ (1 ∈ ℝ → (0 −ℝ 1) ∈ ℝ) | |
| 10 | 8, 9 | ax-mp 5 | . . . 4 ⊢ (0 −ℝ 1) ∈ ℝ |
| 11 | 10 | recni 11323 | . . 3 ⊢ (0 −ℝ 1) ∈ ℂ |
| 12 | 6, 7, 11 | adddii 11321 | . 2 ⊢ (i · (1 + (0 −ℝ 1))) = ((i · 1) + (i · (0 −ℝ 1))) |
| 13 | renegid 43425 | . . . . 5 ⊢ (1 ∈ ℝ → (1 + (0 −ℝ 1)) = 0) | |
| 14 | 8, 13 | ax-mp 5 | . . . 4 ⊢ (1 + (0 −ℝ 1)) = 0 |
| 15 | 14 | oveq2i 7431 | . . 3 ⊢ (i · (1 + (0 −ℝ 1))) = (i · 0) |
| 16 | sn-it0e0 43468 | . . 3 ⊢ (i · 0) = 0 | |
| 17 | 15, 16 | eqtri 2783 | . 2 ⊢ (i · (1 + (0 −ℝ 1))) = 0 |
| 18 | 5, 12, 17 | 3eqtr2i 2789 | 1 ⊢ (i + (i · (i · i))) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 (class class class)co 7420 ℝcr 11199 0cc0 11200 1c1 11201 ici 11202 + caddc 11203 · cmul 11205 −ℝ cresub 43417 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-ltxr 11348 df-2 12405 df-3 12406 df-resub 43418 |
| This theorem is used by: sn-0tie0 43516 |
| Copyright terms: Public domain | W3C validator |