![]() |
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 11149 | . . 3 ⊢ 0R ∈ R | |
2 | mulcnsr 11205 | . . . 4 ⊢ (((𝐴 ∈ R ∧ 0R ∈ R) ∧ (𝐵 ∈ R ∧ 0R ∈ R)) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) | |
3 | 2 | an4s 659 | . . 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 704 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) |
5 | 00sr 11168 | . . . . . . . 8 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
6 | 1, 5 | ax-mp 5 | . . . . . . 7 ⊢ (0R ·R 0R) = 0R |
7 | 6 | oveq2i 7459 | . . . . . 6 ⊢ (-1R ·R (0R ·R 0R)) = (-1R ·R 0R) |
8 | m1r 11151 | . . . . . . 7 ⊢ -1R ∈ R | |
9 | 00sr 11168 | . . . . . . 7 ⊢ (-1R ∈ R → (-1R ·R 0R) = 0R) | |
10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ (-1R ·R 0R) = 0R |
11 | 7, 10 | eqtri 2768 | . . . . 5 ⊢ (-1R ·R (0R ·R 0R)) = 0R |
12 | 11 | oveq2i 7459 | . . . 4 ⊢ ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = ((𝐴 ·R 𝐵) +R 0R) |
13 | mulclsr 11153 | . . . . 5 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (𝐴 ·R 𝐵) ∈ R) | |
14 | 0idsr 11166 | . . . . 5 ⊢ ((𝐴 ·R 𝐵) ∈ R → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) | |
15 | 13, 14 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) |
16 | 12, 15 | eqtrid 2792 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = (𝐴 ·R 𝐵)) |
17 | mulcomsr 11158 | . . . . . 6 ⊢ (0R ·R 𝐵) = (𝐵 ·R 0R) | |
18 | 00sr 11168 | . . . . . 6 ⊢ (𝐵 ∈ R → (𝐵 ·R 0R) = 0R) | |
19 | 17, 18 | eqtrid 2792 | . . . . 5 ⊢ (𝐵 ∈ R → (0R ·R 𝐵) = 0R) |
20 | 00sr 11168 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 ·R 0R) = 0R) | |
21 | 19, 20 | oveqan12rd 7468 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = (0R +R 0R)) |
22 | 0idsr 11166 | . . . . 5 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
23 | 1, 22 | ax-mp 5 | . . . 4 ⊢ (0R +R 0R) = 0R |
24 | 21, 23 | eqtrdi 2796 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = 0R) |
25 | 16, 24 | opeq12d 4905 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉 = 〈(𝐴 ·R 𝐵), 0R〉) |
26 | 4, 25 | eqtrd 2780 | 1 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈(𝐴 ·R 𝐵), 0R〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 〈cop 4654 (class class class)co 7448 Rcnr 10934 0Rc0r 10935 -1Rcm1r 10937 +R cplr 10938 ·R cmr 10939 · cmul 11189 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-oadd 8526 df-omul 8527 df-er 8763 df-ec 8765 df-qs 8769 df-ni 10941 df-pli 10942 df-mi 10943 df-lti 10944 df-plpq 10977 df-mpq 10978 df-ltpq 10979 df-enq 10980 df-nq 10981 df-erq 10982 df-plq 10983 df-mq 10984 df-1nq 10985 df-rq 10986 df-ltnq 10987 df-np 11050 df-1p 11051 df-plp 11052 df-mp 11053 df-ltp 11054 df-enr 11124 df-nr 11125 df-plr 11126 df-mr 11127 df-0r 11129 df-m1r 11131 df-c 11190 df-mul 11196 |
This theorem is referenced by: axmulrcl 11223 ax1rid 11230 axrrecex 11232 axpre-mulgt0 11237 |
Copyright terms: Public domain | W3C validator |