| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > srgdi | Structured version Visualization version GIF version | ||
| Description: Distributive law for the multiplication operation of a semiring. (Contributed by Steve Rodriguez, 9-Sep-2007.) (Revised by Thierry Arnoux, 1-Apr-2018.) |
| Ref | Expression |
|---|---|
| srgdi.b | ⊢ 𝐵 = (Base‘𝑅) |
| srgdi.p | ⊢ + = (+g‘𝑅) |
| srgdi.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| srgdi | ⊢ ((𝑅 ∈ SRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 · (𝑌 + 𝑍)) = ((𝑋 · 𝑌) + (𝑋 · 𝑍))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | srgdi.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | srgdi.p | . . 3 ⊢ + = (+g‘𝑅) | |
| 3 | srgdi.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 4 | 1, 2, 3 | srgdilem 20334 | . 2 ⊢ ((𝑅 ∈ SRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 · (𝑌 + 𝑍)) = ((𝑋 · 𝑌) + (𝑋 · 𝑍)) ∧ ((𝑋 + 𝑌) · 𝑍) = ((𝑋 · 𝑍) + (𝑌 · 𝑍)))) |
| 5 | 4 | simpld 500 | 1 ⊢ ((𝑅 ∈ SRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 · (𝑌 + 𝑍)) = ((𝑋 · 𝑌) + (𝑋 · 𝑍))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 Basecbs 17304 +gcplusg 17345 .rcmulr 17346 SRingcsrg 20328 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-12 2213 ax-ext 2732 ax-nul 5263 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6489 df-fv 6541 df-ov 7417 df-srg 20329 |
| This theorem is used by: srgcom4lem 20355 srglmhm 20363 srgbinomlem 20372 |
| Copyright terms: Public domain | W3C validator |