| 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 11271. (Contributed by NM, 5-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axi2m1 | ⊢ ((i · i) + 1) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0r 11168 | . . . . . 6 ⊢ 0R ∈ R | |
| 2 | 1sr 11169 | . . . . . 6 ⊢ 1R ∈ R | |
| 3 | mulcnsr 11224 | . . . . . 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 11187 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 0R) = 0R |
| 7 | 1idsr 11186 | . . . . . . . . . . 11 ⊢ (1R ∈ R → (1R ·R 1R) = 1R) | |
| 8 | 2, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (1R ·R 1R) = 1R |
| 9 | 8 | oveq2i 7431 | . . . . . . . . 9 ⊢ (-1R ·R (1R ·R 1R)) = (-1R ·R 1R) |
| 10 | m1r 11170 | . . . . . . . . . 10 ⊢ -1R ∈ R | |
| 11 | 1idsr 11186 | . . . . . . . . . 10 ⊢ (-1R ∈ R → (-1R ·R 1R) = -1R) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . . 9 ⊢ (-1R ·R 1R) = -1R |
| 13 | 9, 12 | eqtri 2783 | . . . . . . . 8 ⊢ (-1R ·R (1R ·R 1R)) = -1R |
| 14 | 6, 13 | oveq12i 7432 | . . . . . . 7 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = (0R +R -1R) |
| 15 | addcomsr 11175 | . . . . . . 7 ⊢ (0R +R -1R) = (-1R +R 0R) | |
| 16 | 0idsr 11185 | . . . . . . . 8 ⊢ (-1R ∈ R → (-1R +R 0R) = -1R) | |
| 17 | 10, 16 | ax-mp 5 | . . . . . . 7 ⊢ (-1R +R 0R) = -1R |
| 18 | 14, 15, 17 | 3eqtri 2787 | . . . . . 6 ⊢ ((0R ·R 0R) +R (-1R ·R (1R ·R 1R))) = -1R |
| 19 | 00sr 11187 | . . . . . . . . 9 ⊢ (1R ∈ R → (1R ·R 0R) = 0R) | |
| 20 | 2, 19 | ax-mp 5 | . . . . . . . 8 ⊢ (1R ·R 0R) = 0R |
| 21 | 1idsr 11186 | . . . . . . . . 9 ⊢ (0R ∈ R → (0R ·R 1R) = 0R) | |
| 22 | 1, 21 | ax-mp 5 | . . . . . . . 8 ⊢ (0R ·R 1R) = 0R |
| 23 | 20, 22 | oveq12i 7432 | . . . . . . 7 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = (0R +R 0R) |
| 24 | 0idsr 11185 | . . . . . . . 8 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 25 | 1, 24 | ax-mp 5 | . . . . . . 7 ⊢ (0R +R 0R) = 0R |
| 26 | 23, 25 | eqtri 2783 | . . . . . 6 ⊢ ((1R ·R 0R) +R (0R ·R 1R)) = 0R |
| 27 | 18, 26 | opeq12i 4844 | . . . . 5 ⊢ 〈((0R ·R 0R) +R (-1R ·R (1R ·R 1R))), ((1R ·R 0R) +R (0R ·R 1R))〉 = 〈-1R, 0R〉 |
| 28 | 4, 27 | eqtri 2783 | . . . 4 ⊢ (〈0R, 1R〉 · 〈0R, 1R〉) = 〈-1R, 0R〉 |
| 29 | 28 | oveq1i 7430 | . . 3 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = (〈-1R, 0R〉 + 〈1R, 0R〉) |
| 30 | addresr 11226 | . . . 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 11180 | . . . 4 ⊢ (-1R +R 1R) = 0R | |
| 33 | 32 | opeq1i 4842 | . . 3 ⊢ 〈(-1R +R 1R), 0R〉 = 〈0R, 0R〉 |
| 34 | 29, 31, 33 | 3eqtri 2787 | . 2 ⊢ ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) = 〈0R, 0R〉 |
| 35 | df-i 11212 | . . . 4 ⊢ i = 〈0R, 1R〉 | |
| 36 | 35, 35 | oveq12i 7432 | . . 3 ⊢ (i · i) = (〈0R, 1R〉 · 〈0R, 1R〉) |
| 37 | df-1 11211 | . . 3 ⊢ 1 = 〈1R, 0R〉 | |
| 38 | 36, 37 | oveq12i 7432 | . 2 ⊢ ((i · i) + 1) = ((〈0R, 1R〉 · 〈0R, 1R〉) + 〈1R, 0R〉) |
| 39 | df-0 11210 | . 2 ⊢ 0 = 〈0R, 0R〉 | |
| 40 | 34, 38, 39 | 3eqtr4i 2793 | 1 ⊢ ((i · i) + 1) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 〈cop 4834 (class class class)co 7420 Rcnr 10953 0Rc0r 10954 1Rc1r 10955 -1Rcm1r 10956 +R cplr 10957 ·R cmr 10958 0cc0 11203 1c1 11204 ici 11205 + caddc 11206 · cmul 11208 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9645 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-oadd 8483 df-omul 8484 df-er 8720 df-ec 8722 df-qs 8726 df-ni 10960 df-pli 10961 df-mi 10962 df-lti 10963 df-plpq 10996 df-mpq 10997 df-ltpq 10998 df-enq 10999 df-nq 11000 df-erq 11001 df-plq 11002 df-mq 11003 df-1nq 11004 df-rq 11005 df-ltnq 11006 df-np 11069 df-1p 11070 df-plp 11071 df-mp 11072 df-ltp 11073 df-enr 11143 df-nr 11144 df-plr 11145 df-mr 11146 df-0r 11148 df-1r 11149 df-m1r 11150 df-c 11209 df-0 11210 df-1 11211 df-i 11212 df-add 11214 df-mul 11215 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |