Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulresr | Structured version Visualization version GIF version |
Description: Multiplication of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
mulresr | ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈(𝐴 ·R 𝐵), 0R〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0r 10836 | . . 3 ⊢ 0R ∈ R | |
2 | mulcnsr 10892 | . . . 4 ⊢ (((𝐴 ∈ R ∧ 0R ∈ R) ∧ (𝐵 ∈ R ∧ 0R ∈ R)) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) | |
3 | 2 | an4s 657 | . . 3 ⊢ (((𝐴 ∈ R ∧ 𝐵 ∈ R) ∧ (0R ∈ R ∧ 0R ∈ R)) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) |
4 | 1, 1, 3 | mpanr12 702 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) |
5 | 00sr 10855 | . . . . . . . 8 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
6 | 1, 5 | ax-mp 5 | . . . . . . 7 ⊢ (0R ·R 0R) = 0R |
7 | 6 | oveq2i 7286 | . . . . . 6 ⊢ (-1R ·R (0R ·R 0R)) = (-1R ·R 0R) |
8 | m1r 10838 | . . . . . . 7 ⊢ -1R ∈ R | |
9 | 00sr 10855 | . . . . . . 7 ⊢ (-1R ∈ R → (-1R ·R 0R) = 0R) | |
10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ (-1R ·R 0R) = 0R |
11 | 7, 10 | eqtri 2766 | . . . . 5 ⊢ (-1R ·R (0R ·R 0R)) = 0R |
12 | 11 | oveq2i 7286 | . . . 4 ⊢ ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = ((𝐴 ·R 𝐵) +R 0R) |
13 | mulclsr 10840 | . . . . 5 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (𝐴 ·R 𝐵) ∈ R) | |
14 | 0idsr 10853 | . . . . 5 ⊢ ((𝐴 ·R 𝐵) ∈ R → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) | |
15 | 13, 14 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) |
16 | 12, 15 | eqtrid 2790 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = (𝐴 ·R 𝐵)) |
17 | mulcomsr 10845 | . . . . . 6 ⊢ (0R ·R 𝐵) = (𝐵 ·R 0R) | |
18 | 00sr 10855 | . . . . . 6 ⊢ (𝐵 ∈ R → (𝐵 ·R 0R) = 0R) | |
19 | 17, 18 | eqtrid 2790 | . . . . 5 ⊢ (𝐵 ∈ R → (0R ·R 𝐵) = 0R) |
20 | 00sr 10855 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 ·R 0R) = 0R) | |
21 | 19, 20 | oveqan12rd 7295 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = (0R +R 0R)) |
22 | 0idsr 10853 | . . . . 5 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
23 | 1, 22 | ax-mp 5 | . . . 4 ⊢ (0R +R 0R) = 0R |
24 | 21, 23 | eqtrdi 2794 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = 0R) |
25 | 16, 24 | opeq12d 4812 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉 = 〈(𝐴 ·R 𝐵), 0R〉) |
26 | 4, 25 | eqtrd 2778 | 1 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈(𝐴 ·R 𝐵), 0R〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 〈cop 4567 (class class class)co 7275 Rcnr 10621 0Rc0r 10622 -1Rcm1r 10624 +R cplr 10625 ·R cmr 10626 · cmul 10876 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-inf2 9399 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-omul 8302 df-er 8498 df-ec 8500 df-qs 8504 df-ni 10628 df-pli 10629 df-mi 10630 df-lti 10631 df-plpq 10664 df-mpq 10665 df-ltpq 10666 df-enq 10667 df-nq 10668 df-erq 10669 df-plq 10670 df-mq 10671 df-1nq 10672 df-rq 10673 df-ltnq 10674 df-np 10737 df-1p 10738 df-plp 10739 df-mp 10740 df-ltp 10741 df-enr 10811 df-nr 10812 df-plr 10813 df-mr 10814 df-0r 10816 df-m1r 10818 df-c 10877 df-mul 10883 |
This theorem is referenced by: axmulrcl 10910 ax1rid 10917 axrrecex 10919 axpre-mulgt0 10924 |
Copyright terms: Public domain | W3C validator |