| 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 2733 | . . . . . . 7 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 3 | eqid 2733 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 4 | srgz.t | . . . . . . 7 ⊢ · = (.r‘𝑅) | |
| 5 | srgz.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 6 | 1, 2, 3, 4, 5 | issrg 20114 | . . . . . 6 ⊢ (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))) |
| 7 | 6 | simp3bi 1147 | . . . . 5 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))) |
| 8 | 7 | r19.21bi 3225 | . . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))) |
| 9 | 8 | simprld 771 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → ( 0 · 𝑥) = 0 ) |
| 10 | 9 | ralrimiva 3125 | . 2 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 ( 0 · 𝑥) = 0 ) |
| 11 | oveq2 7363 | . . . 4 ⊢ (𝑥 = 𝑋 → ( 0 · 𝑥) = ( 0 · 𝑋)) | |
| 12 | 11 | eqeq1d 2735 | . . 3 ⊢ (𝑥 = 𝑋 → (( 0 · 𝑥) = 0 ↔ ( 0 · 𝑋) = 0 )) |
| 13 | 12 | rspcv 3569 | . 2 ⊢ (𝑋 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 ( 0 · 𝑥) = 0 → ( 0 · 𝑋) = 0 )) |
| 14 | 10, 13 | mpan9 506 | 1 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3048 ‘cfv 6489 (class class class)co 7355 Basecbs 17127 +gcplusg 17168 .rcmulr 17169 0gc0g 17350 Mndcmnd 18650 CMndccmn 19700 mulGrpcmgp 20066 SRingcsrg 20112 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-12 2182 ax-ext 2705 ax-nul 5248 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ne 2930 df-ral 3049 df-rab 3397 df-v 3439 df-sbc 3738 df-dif 3901 df-un 3903 df-ss 3915 df-nul 4283 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-iota 6445 df-fv 6497 df-ov 7358 df-srg 20113 |
| This theorem is referenced by: srgmulgass 20143 srgrmhm 20148 |
| Copyright terms: Public domain | W3C validator |