| 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 11196. (Contributed by NM, 5-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axi2m1 | ⊢ ((i · i) + 1) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0r 11093 | . . . . . 6 ⊢ 0R ∈ R | |
| 2 | 1sr 11094 | . . . . . 6 ⊢ 1R ∈ R | |
| 3 | mulcnsr 11149 | . . . . . 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 11112 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 0R) = 0R |
| 7 | 1idsr 11111 | . . . . . . . . . . 11 ⊢ (1R ∈ R → (1R ·R 1R) = 1R) | |
| 8 | 2, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (1R ·R 1R) = 1R |
| 9 | 8 | oveq2i 7428 | . . . . . . . . 9 ⊢ (-1R ·R (1R ·R 1R)) = (-1R ·R 1R) |
| 10 | m1r 11095 | . . . . . . . . . 10 ⊢ -1R ∈ R | |
| 11 | 1idsr 11111 | . . . . . . . . . 10 ⊢ (-1R ∈ R → (-1R ·R 1R) = -1R) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . . 9 ⊢ (-1R ·R 1R) = -1R |
| 13 | 9, 12 | eqtri 2785 | . . . . . . . 8 ⊢ (-1R ·R (1R ·R 1R)) = -1R |
| 14 | 6, 13 | oveq12i 7429 | . . . . . . 7 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = (0R +R -1R) |
| 15 | addcomsr 11100 | . . . . . . 7 ⊢ (0R +R -1R) = (-1R +R 0R) | |
| 16 | 0idsr 11110 | . . . . . . . 8 ⊢ (-1R ∈ R → (-1R +R 0R) = -1R) | |
| 17 | 10, 16 | ax-mp 5 | . . . . . . 7 ⊢ (-1R +R 0R) = -1R |
| 18 | 14, 15, 17 | 3eqtri 2789 | . . . . . 6 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = -1R |
| 19 | 00sr 11112 | . . . . . . . . 9 ⊢ (1R ∈ R → (1R ·R 0R) = 0R) | |
| 20 | 2, 19 | ax-mp 5 | . . . . . . . 8 ⊢ (1R ·R 0R) = 0R |
| 21 | 1idsr 11111 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 1R) = 0R) | |
| 22 | 1, 21 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 1R) = 0R |
| 23 | 20, 22 | oveq12i 7429 | . . . . . . 7 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = (0R +R 0R) |
| 24 | 0idsr 11110 | . . . . . . . 8 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 25 | 1, 24 | ax-mp 5 | . . . . . . 7 ⊢ (0R +R 0R) = 0R |
| 26 | 23, 25 | eqtri 2785 | . . . . . 6 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = 0R |
| 27 | 18, 26 | opeq12i 4841 | . . . . 5 ⊢ 〈((0R ·R 0R) +R (-1R ·R (1R ·R 1R))), ((1R ·R 0R) +R (0R ·R 1R))〉 = 〈-1R, 0R〉 |
| 28 | 4, 27 | eqtri 2785 | . . . 4 ⊢ (〈0R, 1R〉 · 〈0R, 1R〉) = 〈-1R, 0R〉 |
| 29 | 28 | oveq1i 7427 | . . 3 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = (〈-1R, 0R〉 + 〈1R, 0R〉) |
| 30 | addresr 11151 | . . . 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 11105 | . . . 4 ⊢ (-1R +R 1R) = 0R | |
| 33 | 32 | opeq1i 4839 | . . 3 ⊢ 〈(-1R +R 1R), 0R〉 = 〈0R, 0R〉 |
| 34 | 29, 31, 33 | 3eqtri 2789 | . 2 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = 〈0R, 0R〉 |
| 35 | df-i 11137 | . . . 4 ⊢ i = 〈0R, 1R〉 | |
| 36 | 35, 35 | oveq12i 7429 | . . 3 ⊢ (i · i) = (〈0R, 1R〉 · 〈0R, 1R〉) |
| 37 | df-1 11136 | . . 3 ⊢ 1 = 〈1R, 0R〉 | |
| 38 | 36, 37 | oveq12i 7429 | . 2 ⊢ ((i · i) + 1) = ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) |
| 39 | df-0 11135 | . 2 ⊢ 0 = 〈0R, 0R〉 | |
| 40 | 34, 38, 39 | 3eqtr4i 2795 | 1 ⊢ ((i · i) + 1) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 〈cop 4593 (class class class)co 7417 Rcnr 10878 0Rc0r 10879 1Rc1r 10880 -1Rcm1r 10881 +R cplr 10882 ·R cmr 10883 0cc0 11128 1c1 11129 ici 11130 + caddc 11131 · cmul 11133 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-oadd 8463 df-omul 8464 df-er 8700 df-ec 8702 df-qs 8706 df-ni 10885 df-pli 10886 df-mi 10887 df-lti 10888 df-plpq 10921 df-mpq 10922 df-ltpq 10923 df-enq 10924 df-nq 10925 df-erq 10926 df-plq 10927 df-mq 10928 df-1nq 10929 df-rq 10930 df-ltnq 10931 df-np 10994 df-1p 10995 df-plp 10996 df-mp 10997 df-ltp 10998 df-enr 11068 df-nr 11069 df-plr 11070 df-mr 11071 df-0r 11073 df-1r 11074 df-m1r 11075 df-c 11134 df-0 11135 df-1 11136 df-i 11137 df-add 11139 df-mul 11140 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |