| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rei4 | Structured version Visualization version GIF version | ||
| Description: i4 14245 without ax-mulcom 11168. (Contributed by SN, 27-May-2024.) |
| Ref | Expression |
|---|---|
| rei4 | ⊢ ((i · i) · (i · i)) = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reixi 43212 | . . 3 ⊢ (i · i) = (0 −ℝ 1) | |
| 2 | 1, 1 | oveq12i 7422 | . 2 ⊢ ((i · i) · (i · i)) = ((0 −ℝ 1) · (0 −ℝ 1)) |
| 3 | 1re 11212 | . . 3 ⊢ 1 ∈ ℝ | |
| 4 | rernegcl 43160 | . . . . 5 ⊢ (1 ∈ ℝ → (0 −ℝ 1) ∈ ℝ) | |
| 5 | 1red 11213 | . . . . 5 ⊢ (1 ∈ ℝ → 1 ∈ ℝ) | |
| 6 | 4, 5 | remulneg2d 43204 | . . . 4 ⊢ (1 ∈ ℝ → ((0 −ℝ 1) · (0 −ℝ 1)) = (0 −ℝ ((0 −ℝ 1) · 1))) |
| 7 | ax-1rid 11174 | . . . . . 6 ⊢ ((0 −ℝ 1) ∈ ℝ → ((0 −ℝ 1) · 1) = (0 −ℝ 1)) | |
| 8 | 4, 7 | syl 18 | . . . . 5 ⊢ (1 ∈ ℝ → ((0 −ℝ 1) · 1) = (0 −ℝ 1)) |
| 9 | 8 | oveq2d 7426 | . . . 4 ⊢ (1 ∈ ℝ → (0 −ℝ ((0 −ℝ 1) · 1)) = (0 −ℝ (0 −ℝ 1))) |
| 10 | renegneg 43201 | . . . 4 ⊢ (1 ∈ ℝ → (0 −ℝ (0 −ℝ 1)) = 1) | |
| 11 | 6, 9, 10 | 3eqtrd 2802 | . . 3 ⊢ (1 ∈ ℝ → ((0 −ℝ 1) · (0 −ℝ 1)) = 1) |
| 12 | 3, 11 | ax-mp 5 | . 2 ⊢ ((0 −ℝ 1) · (0 −ℝ 1)) = 1 |
| 13 | 2, 12 | eqtri 2786 | 1 ⊢ ((i · i) · (i · i)) = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2143 (class class class)co 7410 ℝcr 11103 0cc0 11104 1c1 11105 ici 11106 · cmul 11109 −ℝ cresub 43154 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-po 5569 df-so 5570 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-ltxr 11252 df-2 12307 df-3 12308 df-resub 43155 |
| This theorem is used by: sn-1ticom 43224 sn-0tie0 43253 |
| Copyright terms: Public domain | W3C validator |