| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > srglz | Structured version Visualization version GIF version | ||
| Description: The zero of a semiring is a left-absorbing element. (Contributed by AV, 23-Aug-2019.) |
| Ref | Expression |
|---|---|
| srgz.b | ⊢ 𝐵 = (Base‘𝑅) |
| srgz.t | ⊢ · = (.r‘𝑅) |
| srgz.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| srglz | ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | srgz.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | eqid 2761 | . . . . . . 7 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 3 | eqid 2761 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 4 | srgz.t | . . . . . . 7 ⊢ · = (.r‘𝑅) | |
| 5 | srgz.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 6 | 1, 2, 3, 4, 5 | issrg 20225 | . . . . . 6 ⊢ (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))) |
| 7 | 6 | simp3bi 1159 | . . . . 5 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))) |
| 8 | 7 | r19.21bi 3253 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))) |
| 9 | 8 | simprld 781 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → ( 0 · 𝑥) = 0 ) |
| 10 | 9 | ralrimiva 3153 | . 2 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 ( 0 · 𝑥) = 0 ) |
| 11 | oveq2 7399 | . . . 4 ⊢ (𝑥 = 𝑋 → ( 0 · 𝑥) = ( 0 · 𝑋)) | |
| 12 | 11 | eqeq1d 2763 | . . 3 ⊢ (𝑥 = 𝑋 → (( 0 · 𝑥) = 0 ↔ ( 0 · 𝑋) = 0 )) |
| 13 | 12 | rspcv 3576 | . 2 ⊢ (𝑋 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 ( 0 · 𝑥) = 0 → ( 0 · 𝑋) = 0 )) |
| 14 | 10, 13 | mpan9 514 | 1 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∀wral 3075 ‘cfv 6516 (class class class)co 7391 Basecbs 17236 +gcplusg 17277 .rcmulr 17278 0gc0g 17459 Mndcmnd 18759 CMndccmn 19811 mulGrpcmgp 20177 SRingcsrg 20223 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-12 2211 ax-ext 2733 ax-nul 5253 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rab 3414 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-iota 6472 df-fv 6524 df-ov 7394 df-srg 20224 |
| This theorem is referenced by: srgmulgass 20254 srgrmhm 20259 |
| Copyright terms: Public domain | W3C validator |