| 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 11186. (Contributed by NM, 5-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axi2m1 | ⊢ ((i · i) + 1) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0r 11083 | . . . . . 6 ⊢ 0R ∈ R | |
| 2 | 1sr 11084 | . . . . . 6 ⊢ 1R ∈ R | |
| 3 | mulcnsr 11139 | . . . . . 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 11102 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 0R) = 0R |
| 7 | 1idsr 11101 | . . . . . . . . . . 11 ⊢ (1R ∈ R → (1R ·R 1R) = 1R) | |
| 8 | 2, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (1R ·R 1R) = 1R |
| 9 | 8 | oveq2i 7434 | . . . . . . . . 9 ⊢ (-1R ·R (1R ·R 1R)) = (-1R ·R 1R) |
| 10 | m1r 11085 | . . . . . . . . . 10 ⊢ -1R ∈ R | |
| 11 | 1idsr 11101 | . . . . . . . . . 10 ⊢ (-1R ∈ R → (-1R ·R 1R) = -1R) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . . 9 ⊢ (-1R ·R 1R) = -1R |
| 13 | 9, 12 | eqtri 2789 | . . . . . . . 8 ⊢ (-1R ·R (1R ·R 1R)) = -1R |
| 14 | 6, 13 | oveq12i 7435 | . . . . . . 7 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = (0R +R -1R) |
| 15 | addcomsr 11090 | . . . . . . 7 ⊢ (0R +R -1R) = (-1R +R 0R) | |
| 16 | 0idsr 11100 | . . . . . . . 8 ⊢ (-1R ∈ R → (-1R +R 0R) = -1R) | |
| 17 | 10, 16 | ax-mp 5 | . . . . . . 7 ⊢ (-1R +R 0R) = -1R |
| 18 | 14, 15, 17 | 3eqtri 2793 | . . . . . 6 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = -1R |
| 19 | 00sr 11102 | . . . . . . . . 9 ⊢ (1R ∈ R → (1R ·R 0R) = 0R) | |
| 20 | 2, 19 | ax-mp 5 | . . . . . . . 8 ⊢ (1R ·R 0R) = 0R |
| 21 | 1idsr 11101 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 1R) = 0R) | |
| 22 | 1, 21 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 1R) = 0R |
| 23 | 20, 22 | oveq12i 7435 | . . . . . . 7 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = (0R +R 0R) |
| 24 | 0idsr 11100 | . . . . . . . 8 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 25 | 1, 24 | ax-mp 5 | . . . . . . 7 ⊢ (0R +R 0R) = 0R |
| 26 | 23, 25 | eqtri 2789 | . . . . . 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 2789 | . . . 4 ⊢ (〈0R, 1R〉 · 〈0R, 1R〉) = 〈-1R, 0R〉 |
| 29 | 28 | oveq1i 7433 | . . 3 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = (〈-1R, 0R〉 + 〈1R, 0R〉) |
| 30 | addresr 11141 | . . . 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 11095 | . . . 4 ⊢ (-1R +R 1R) = 0R | |
| 33 | 32 | opeq1i 4846 | . . 3 ⊢ 〈(-1R +R 1R), 0R〉 = 〈0R, 0R〉 |
| 34 | 29, 31, 33 | 3eqtri 2793 | . 2 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = 〈0R, 0R〉 |
| 35 | df-i 11127 | . . . 4 ⊢ i = 〈0R, 1R〉 | |
| 36 | 35, 35 | oveq12i 7435 | . . 3 ⊢ (i · i) = (〈0R, 1R〉 · 〈0R, 1R〉) |
| 37 | df-1 11126 | . . 3 ⊢ 1 = 〈1R, 0R〉 | |
| 38 | 36, 37 | oveq12i 7435 | . 2 ⊢ ((i · i) + 1) = ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) |
| 39 | df-0 11125 | . 2 ⊢ 0 = 〈0R, 0R〉 | |
| 40 | 34, 38, 39 | 3eqtr4i 2799 | 1 ⊢ ((i · i) + 1) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 〈cop 4600 (class class class)co 7423 Rcnr 10868 0Rc0r 10869 1Rc1r 10870 -1Rcm1r 10871 +R cplr 10872 ·R cmr 10873 0cc0 11118 1c1 11119 ici 11120 + caddc 11121 · cmul 11123 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-oadd 8466 df-omul 8467 df-er 8703 df-ec 8705 df-qs 8709 df-ni 10875 df-pli 10876 df-mi 10877 df-lti 10878 df-plpq 10911 df-mpq 10912 df-ltpq 10913 df-enq 10914 df-nq 10915 df-erq 10916 df-plq 10917 df-mq 10918 df-1nq 10919 df-rq 10920 df-ltnq 10921 df-np 10984 df-1p 10985 df-plp 10986 df-mp 10987 df-ltp 10988 df-enr 11058 df-nr 11059 df-plr 11060 df-mr 11061 df-0r 11063 df-1r 11064 df-m1r 11065 df-c 11124 df-0 11125 df-1 11126 df-i 11127 df-add 11129 df-mul 11130 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |