| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulresr | GIF version | ||
| Description: Multiplication of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.) |
| Ref | Expression |
|---|---|
| mulresr | ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈(𝐴 ·R 𝐵), 0R〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0r 7953 | . . 3 ⊢ 0R ∈ R | |
| 2 | mulcnsr 8038 | . . . 4 ⊢ (((𝐴 ∈ R ∧ 0R ∈ R) ∧ (𝐵 ∈ R ∧ 0R ∈ R)) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) | |
| 3 | 2 | an4s 590 | . . 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 439 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) |
| 5 | 00sr 7972 | . . . . . . . 8 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . 7 ⊢ (0R ·R 0R) = 0R |
| 7 | 6 | oveq2i 6021 | . . . . . 6 ⊢ (-1R ·R (0R ·R 0R)) = (-1R ·R 0R) |
| 8 | m1r 7955 | . . . . . . 7 ⊢ -1R ∈ R | |
| 9 | 00sr 7972 | . . . . . . 7 ⊢ (-1R ∈ R → (-1R ·R 0R) = 0R) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ (-1R ·R 0R) = 0R |
| 11 | 7, 10 | eqtri 2250 | . . . . 5 ⊢ (-1R ·R (0R ·R 0R)) = 0R |
| 12 | 11 | oveq2i 6021 | . . . 4 ⊢ ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = ((𝐴 ·R 𝐵) +R 0R) |
| 13 | mulclsr 7957 | . . . . 5 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (𝐴 ·R 𝐵) ∈ R) | |
| 14 | 0idsr 7970 | . . . . 5 ⊢ ((𝐴 ·R 𝐵) ∈ R → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) |
| 16 | 12, 15 | eqtrid 2274 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = (𝐴 ·R 𝐵)) |
| 17 | mulcomsrg 7960 | . . . . . . 7 ⊢ ((0R ∈ R ∧ 𝐵 ∈ R) → (0R ·R 𝐵) = (𝐵 ·R 0R)) | |
| 18 | 1, 17 | mpan 424 | . . . . . 6 ⊢ (𝐵 ∈ R → (0R ·R 𝐵) = (𝐵 ·R 0R)) |
| 19 | 00sr 7972 | . . . . . 6 ⊢ (𝐵 ∈ R → (𝐵 ·R 0R) = 0R) | |
| 20 | 18, 19 | eqtrd 2262 | . . . . 5 ⊢ (𝐵 ∈ R → (0R ·R 𝐵) = 0R) |
| 21 | 00sr 7972 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 ·R 0R) = 0R) | |
| 22 | 20, 21 | oveqan12rd 6030 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = (0R +R 0R)) |
| 23 | 0idsr 7970 | . . . . 5 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 24 | 1, 23 | ax-mp 5 | . . . 4 ⊢ (0R +R 0R) = 0R |
| 25 | 22, 24 | eqtrdi 2278 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = 0R) |
| 26 | 16, 25 | opeq12d 3865 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉 = 〈(𝐴 ·R 𝐵), 0R〉) |
| 27 | 4, 26 | eqtrd 2262 | 1 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈(𝐴 ·R 𝐵), 0R〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 〈cop 3669 (class class class)co 6010 Rcnr 7500 0Rc0r 7501 -1Rcm1r 7503 +R cplr 7504 ·R cmr 7505 · cmul 8020 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-iinf 4681 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-eprel 4381 df-id 4385 df-po 4388 df-iso 4389 df-iord 4458 df-on 4460 df-suc 4463 df-iom 4684 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-recs 6462 df-irdg 6527 df-1o 6573 df-2o 6574 df-oadd 6577 df-omul 6578 df-er 6693 df-ec 6695 df-qs 6699 df-ni 7507 df-pli 7508 df-mi 7509 df-lti 7510 df-plpq 7547 df-mpq 7548 df-enq 7550 df-nqqs 7551 df-plqqs 7552 df-mqqs 7553 df-1nqqs 7554 df-rq 7555 df-ltnqqs 7556 df-enq0 7627 df-nq0 7628 df-0nq0 7629 df-plq0 7630 df-mq0 7631 df-inp 7669 df-i1p 7670 df-iplp 7671 df-imp 7672 df-enr 7929 df-nr 7930 df-plr 7931 df-mr 7932 df-0r 7934 df-m1r 7936 df-c 8021 df-mul 8027 |
| This theorem is referenced by: recidpirq 8061 axmulrcl 8070 ax1rid 8080 axprecex 8083 axpre-mulgt0 8090 axpre-mulext 8091 |
| Copyright terms: Public domain | W3C validator |