| 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 11249. (Contributed by NM, 5-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axi2m1 | ⊢ ((i · i) + 1) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0r 11146 | . . . . . 6 ⊢ 0R ∈ R | |
| 2 | 1sr 11147 | . . . . . 6 ⊢ 1R ∈ R | |
| 3 | mulcnsr 11202 | . . . . . 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 11165 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 0R) = 0R |
| 7 | 1idsr 11164 | . . . . . . . . . . 11 ⊢ (1R ∈ R → (1R ·R 1R) = 1R) | |
| 8 | 2, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (1R ·R 1R) = 1R |
| 9 | 8 | oveq2i 7423 | . . . . . . . . 9 ⊢ (-1R ·R (1R ·R 1R)) = (-1R ·R 1R) |
| 10 | m1r 11148 | . . . . . . . . . 10 ⊢ -1R ∈ R | |
| 11 | 1idsr 11164 | . . . . . . . . . 10 ⊢ (-1R ∈ R → (-1R ·R 1R) = -1R) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . . 9 ⊢ (-1R ·R 1R) = -1R |
| 13 | 9, 12 | eqtri 2784 | . . . . . . . 8 ⊢ (-1R ·R (1R ·R 1R)) = -1R |
| 14 | 6, 13 | oveq12i 7424 | . . . . . . 7 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = (0R +R -1R) |
| 15 | addcomsr 11153 | . . . . . . 7 ⊢ (0R +R -1R) = (-1R +R 0R) | |
| 16 | 0idsr 11163 | . . . . . . . 8 ⊢ (-1R ∈ R → (-1R +R 0R) = -1R) | |
| 17 | 10, 16 | ax-mp 5 | . . . . . . 7 ⊢ (-1R +R 0R) = -1R |
| 18 | 14, 15, 17 | 3eqtri 2788 | . . . . . 6 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = -1R |
| 19 | 00sr 11165 | . . . . . . . . 9 ⊢ (1R ∈ R → (1R ·R 0R) = 0R) | |
| 20 | 2, 19 | ax-mp 5 | . . . . . . . 8 ⊢ (1R ·R 0R) = 0R |
| 21 | 1idsr 11164 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 1R) = 0R) | |
| 22 | 1, 21 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 1R) = 0R |
| 23 | 20, 22 | oveq12i 7424 | . . . . . . 7 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = (0R +R 0R) |
| 24 | 0idsr 11163 | . . . . . . . 8 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 25 | 1, 24 | ax-mp 5 | . . . . . . 7 ⊢ (0R +R 0R) = 0R |
| 26 | 23, 25 | eqtri 2784 | . . . . . 6 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = 0R |
| 27 | 18, 26 | opeq12i 4838 | . . . . 5 ⊢ 〈((0R ·R 0R) +R (-1R ·R (1R ·R 1R))), ((1R ·R 0R) +R (0R ·R 1R))〉 = 〈-1R, 0R〉 |
| 28 | 4, 27 | eqtri 2784 | . . . 4 ⊢ (〈0R, 1R〉 · 〈0R, 1R〉) = 〈-1R, 0R〉 |
| 29 | 28 | oveq1i 7422 | . . 3 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = (〈-1R, 0R〉 + 〈1R, 0R〉) |
| 30 | addresr 11204 | . . . 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 11158 | . . . 4 ⊢ (-1R +R 1R) = 0R | |
| 33 | 32 | opeq1i 4836 | . . 3 ⊢ 〈(-1R +R 1R), 0R〉 = 〈0R, 0R〉 |
| 34 | 29, 31, 33 | 3eqtri 2788 | . 2 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = 〈0R, 0R〉 |
| 35 | df-i 11190 | . . . 4 ⊢ i = 〈0R, 1R〉 | |
| 36 | 35, 35 | oveq12i 7424 | . . 3 ⊢ (i · i) = (〈0R, 1R〉 · 〈0R, 1R〉) |
| 37 | df-1 11189 | . . 3 ⊢ 1 = 〈1R, 0R〉 | |
| 38 | 36, 37 | oveq12i 7424 | . 2 ⊢ ((i · i) + 1) = ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) |
| 39 | df-0 11188 | . 2 ⊢ 0 = 〈0R, 0R〉 | |
| 40 | 34, 38, 39 | 3eqtr4i 2794 | 1 ⊢ ((i · i) + 1) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 〈cop 4590 (class class class)co 7412 Rcnr 10931 0Rc0r 10932 1Rc1r 10933 -1Rcm1r 10934 +R cplr 10935 ·R cmr 10936 0cc0 11181 1c1 11182 ici 11183 + caddc 11184 · cmul 11186 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-oadd 8464 df-omul 8465 df-er 8701 df-ec 8703 df-qs 8707 df-ni 10938 df-pli 10939 df-mi 10940 df-lti 10941 df-plpq 10974 df-mpq 10975 df-ltpq 10976 df-enq 10977 df-nq 10978 df-erq 10979 df-plq 10980 df-mq 10981 df-1nq 10982 df-rq 10983 df-ltnq 10984 df-np 11047 df-1p 11048 df-plp 11049 df-mp 11050 df-ltp 11051 df-enr 11121 df-nr 11122 df-plr 11123 df-mr 11124 df-0r 11126 df-1r 11127 df-m1r 11128 df-c 11187 df-0 11188 df-1 11189 df-i 11190 df-add 11192 df-mul 11193 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |