| 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 8013 | . . 3 ⊢ 0R ∈ R | |
| 2 | mulcnsr 8098 | . . . 4 ⊢ (((𝐴 ∈ R ∧ 0R ∈ R) ∧ (𝐵 ∈ R ∧ 0R ∈ R)) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉) | |
| 3 | 2 | an4s 592 | . . 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 8032 | . . . . . . . 8 ⊢ (0R ∈ R → (0R ·R 0R) = 0R) | |
| 6 | 1, 5 | ax-mp 5 | . . . . . . 7 ⊢ (0R ·R 0R) = 0R |
| 7 | 6 | oveq2i 6039 | . . . . . 6 ⊢ (-1R ·R (0R ·R 0R)) = (-1R ·R 0R) |
| 8 | m1r 8015 | . . . . . . 7 ⊢ -1R ∈ R | |
| 9 | 00sr 8032 | . . . . . . 7 ⊢ (-1R ∈ R → (-1R ·R 0R) = 0R) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ (-1R ·R 0R) = 0R |
| 11 | 7, 10 | eqtri 2252 | . . . . 5 ⊢ (-1R ·R (0R ·R 0R)) = 0R |
| 12 | 11 | oveq2i 6039 | . . . 4 ⊢ ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = ((𝐴 ·R 𝐵) +R 0R) |
| 13 | mulclsr 8017 | . . . . 5 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (𝐴 ·R 𝐵) ∈ R) | |
| 14 | 0idsr 8030 | . . . . 5 ⊢ ((𝐴 ·R 𝐵) ∈ R → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R 0R) = (𝐴 ·R 𝐵)) |
| 16 | 12, 15 | eqtrid 2276 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))) = (𝐴 ·R 𝐵)) |
| 17 | mulcomsrg 8020 | . . . . . . 7 ⊢ ((0R ∈ R ∧ 𝐵 ∈ R) → (0R ·R 𝐵) = (𝐵 ·R 0R)) | |
| 18 | 1, 17 | mpan 424 | . . . . . 6 ⊢ (𝐵 ∈ R → (0R ·R 𝐵) = (𝐵 ·R 0R)) |
| 19 | 00sr 8032 | . . . . . 6 ⊢ (𝐵 ∈ R → (𝐵 ·R 0R) = 0R) | |
| 20 | 18, 19 | eqtrd 2264 | . . . . 5 ⊢ (𝐵 ∈ R → (0R ·R 𝐵) = 0R) |
| 21 | 00sr 8032 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 ·R 0R) = 0R) | |
| 22 | 20, 21 | oveqan12rd 6048 | . . . 4 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = (0R +R 0R)) |
| 23 | 0idsr 8030 | . . . . 5 ⊢ (0R ∈ R → (0R +R 0R) = 0R) | |
| 24 | 1, 23 | ax-mp 5 | . . . 4 ⊢ (0R +R 0R) = 0R |
| 25 | 22, 24 | eqtrdi 2280 | . . 3 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → ((0R ·R 𝐵) +R (𝐴 ·R 0R)) = 0R) |
| 26 | 16, 25 | opeq12d 3875 | . 2 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → 〈((𝐴 ·R 𝐵) +R (-1R ·R (0R ·R 0R))), ((0R ·R 𝐵) +R (𝐴 ·R 0R))〉 = 〈(𝐴 ·R 𝐵), 0R〉) |
| 27 | 4, 26 | eqtrd 2264 | 1 ⊢ ((𝐴 ∈ R ∧ 𝐵 ∈ R) → (〈𝐴, 0R〉 · 〈𝐵, 0R〉) = 〈(𝐴 ·R 𝐵), 0R〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 〈cop 3676 (class class class)co 6028 Rcnr 7560 0Rc0r 7561 -1Rcm1r 7563 +R cplr 7564 ·R cmr 7565 · cmul 8080 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-eprel 4392 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-1o 6625 df-2o 6626 df-oadd 6629 df-omul 6630 df-er 6745 df-ec 6747 df-qs 6751 df-ni 7567 df-pli 7568 df-mi 7569 df-lti 7570 df-plpq 7607 df-mpq 7608 df-enq 7610 df-nqqs 7611 df-plqqs 7612 df-mqqs 7613 df-1nqqs 7614 df-rq 7615 df-ltnqqs 7616 df-enq0 7687 df-nq0 7688 df-0nq0 7689 df-plq0 7690 df-mq0 7691 df-inp 7729 df-i1p 7730 df-iplp 7731 df-imp 7732 df-enr 7989 df-nr 7990 df-plr 7991 df-mr 7992 df-0r 7994 df-m1r 7996 df-c 8081 df-mul 8087 |
| This theorem is referenced by: recidpirq 8121 axmulrcl 8130 ax1rid 8140 axprecex 8143 axpre-mulgt0 8150 axpre-mulext 8151 |
| Copyright terms: Public domain | W3C validator |