| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axi2m1 | Structured version Visualization version GIF version | ||
| Description: i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom 12 of 22 for real and complex numbers, derived from ZF set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-i2m1 11295. (Contributed by NM, 5-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axi2m1 | ⊢ ((i · i) + 1) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0r 11192 | . . . . . 6 ⊢ 0R ∈ R | |
| 2 | 1sr 11193 | . . . . . 6 ⊢ 1R ∈ R | |
| 3 | mulcnsr 11248 | . . . . . 6 ⊢ (((0R ∈ R ∧ 1R ∈ R) ∧ (0R ∈ R ∧ 1R ∈ R)) → (〈0R, 1R〉 · 〈0R, 1R〉) = 〈((0R ·R 0R) +R (-1R ·R (1R ·R 1R))), ((1R ·R 0R) +R (0R ·R 1R))〉) | |
| 4 | 1, 2, 1, 2, 3 | mp4an 706 | . . . . 5 ⊢ (〈0R, 1R〉 · 〈0R, 1R〉) = 〈((0R ·R 0R) +R (-1R ·R (1R ·R 1R))), ((1R ·R 0R) +R (0R ·R 1R))〉 |
| 5 | 00sr 11211 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 0R) = 0R |
| 7 | 1idsr 11210 | . . . . . . . . . . 11 ⊢ (1R ∈ R → (1R ·R 1R) = 1R) | |
| 8 | 2, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (1R ·R 1R) = 1R |
| 9 | 8 | oveq2i 7454 | . . . . . . . . 9 ⊢ (-1R ·R (1R ·R 1R)) = (-1R ·R 1R) |
| 10 | m1r 11194 | . . . . . . . . . 10 ⊢ -1R ∈ R | |
| 11 | 1idsr 11210 | . . . . . . . . . 10 ⊢ (-1R ∈ R → (-1R ·R 1R) = -1R) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . . 9 ⊢ (-1R ·R 1R) = -1R |
| 13 | 9, 12 | eqtri 2786 | . . . . . . . 8 ⊢ (-1R ·R (1R ·R 1R)) = -1R |
| 14 | 6, 13 | oveq12i 7455 | . . . . . . 7 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = (0R +R -1R) |
| 15 | addcomsr 11199 | . . . . . . 7 ⊢ (0R +R -1R) = (-1R +R 0R) | |
| 16 | 0idsr 11209 | . . . . . . . 8 ⊢ (-1R ∈ R → (-1R +R 0R) = -1R) | |
| 17 | 10, 16 | ax-mp 5 | . . . . . . 7 ⊢ (-1R +R 0R) = -1R |
| 18 | 14, 15, 17 | 3eqtri 2790 | . . . . . 6 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = -1R |
| 19 | 00sr 11211 | . . . . . . . . 9 ⊢ (1R ∈ R → (1R ·R 0R) = 0R) | |
| 20 | 2, 19 | ax-mp 5 | . . . . . . . 8 ⊢ (1R ·R 0R) = 0R |
| 21 | 1idsr 11210 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 1R) = 0R) | |
| 22 | 1, 21 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 1R) = 0R |
| 23 | 20, 22 | oveq12i 7455 | . . . . . . 7 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = (0R +R 0R) |
| 24 | 0idsr 11209 | . . . . . . . 8 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 25 | 1, 24 | ax-mp 5 | . . . . . . 7 ⊢ (0R +R 0R) = 0R |
| 26 | 23, 25 | eqtri 2786 | . . . . . 6 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = 0R |
| 27 | 18, 26 | opeq12i 4848 | . . . . 5 ⊢ 〈((0R ·R 0R) +R (-1R ·R (1R ·R 1R))), ((1R ·R 0R) +R (0R ·R 1R))〉 = 〈-1R, 0R〉 |
| 28 | 4, 27 | eqtri 2786 | . . . 4 ⊢ (〈0R, 1R〉 · 〈0R, 1R〉) = 〈-1R, 0R〉 |
| 29 | 28 | oveq1i 7453 | . . 3 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = (〈-1R, 0R〉 + 〈1R, 0R〉) |
| 30 | addresr 11250 | . . . 4 ⊢ ((-1R ∈ R ∧ 1R ∈ R) → (〈-1R, 0R〉 + 〈1R, 0R〉) = 〈(-1R +R 1R), 0R〉) | |
| 31 | 10, 2, 30 | mp2an 705 | . . 3 ⊢ (〈-1R, 0R〉 + 〈1R, 0R〉) = 〈(-1R +R 1R), 0R〉 |
| 32 | m1p1sr 11204 | . . . 4 ⊢ (-1R +R 1R) = 0R | |
| 33 | 32 | opeq1i 4846 | . . 3 ⊢ 〈(-1R +R 1R), 0R〉 = 〈0R, 0R〉 |
| 34 | 29, 31, 33 | 3eqtri 2790 | . 2 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = 〈0R, 0R〉 |
| 35 | df-i 11236 | . . . 4 ⊢ i = 〈0R, 1R〉 | |
| 36 | 35, 35 | oveq12i 7455 | . . 3 ⊢ (i · i) = (〈0R, 1R〉 · 〈0R, 1R〉) |
| 37 | df-1 11235 | . . 3 ⊢ 1 = 〈1R, 0R〉 | |
| 38 | 36, 37 | oveq12i 7455 | . 2 ⊢ ((i · i) + 1) = ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) |
| 39 | df-0 11234 | . 2 ⊢ 0 = 〈0R, 0R〉 | |
| 40 | 34, 38, 39 | 3eqtr4i 2796 | 1 ⊢ ((i · i) + 1) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 〈cop 4838 (class class class)co 7443 Rcnr 10977 0Rc0r 10978 1Rc1r 10979 -1Rcm1r 10980 +R cplr 10981 ·R cmr 10982 0cc0 11227 1c1 11228 ici 11229 + caddc 11230 · cmul 11232 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-inf2 9669 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 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 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-oadd 8508 df-omul 8509 df-er 8745 df-ec 8747 df-qs 8751 df-ni 10984 df-pli 10985 df-mi 10986 df-lti 10987 df-plpq 11020 df-mpq 11021 df-ltpq 11022 df-enq 11023 df-nq 11024 df-erq 11025 df-plq 11026 df-mq 11027 df-1nq 11028 df-rq 11029 df-ltnq 11030 df-np 11093 df-1p 11094 df-plp 11095 df-mp 11096 df-ltp 11097 df-enr 11167 df-nr 11168 df-plr 11169 df-mr 11170 df-0r 11172 df-1r 11173 df-m1r 11174 df-c 11233 df-0 11234 df-1 11235 df-i 11236 df-add 11238 df-mul 11239 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |