Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sgrp0 | Structured version Visualization version GIF version |
Description: Any set with an empty base set and any group operation is a semigroup. (Contributed by AV, 28-Aug-2021.) |
Ref | Expression |
---|---|
sgrp0 | ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Smgrp) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mgm0 18438 | . 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Mgm) | |
2 | rzal 4458 | . . 3 ⊢ ((Base‘𝑀) = ∅ → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧))) | |
3 | 2 | adantl 483 | . 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧))) |
4 | eqid 2737 | . . 3 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
5 | eqid 2737 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
6 | 4, 5 | issgrp 18474 | . 2 ⊢ (𝑀 ∈ Smgrp ↔ (𝑀 ∈ Mgm ∧ ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))) |
7 | 1, 3, 6 | sylanbrc 584 | 1 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Smgrp) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1541 ∈ wcel 2106 ∀wral 3062 ∅c0 4274 ‘cfv 6484 (class class class)co 7342 Basecbs 17010 +gcplusg 17060 Mgmcmgm 18422 Smgrpcsgrp 18472 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2708 ax-nul 5255 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2715 df-cleq 2729 df-clel 2815 df-ne 2942 df-ral 3063 df-rab 3405 df-v 3444 df-sbc 3732 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4275 df-if 4479 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4858 df-br 5098 df-iota 6436 df-fv 6492 df-ov 7345 df-mgm 18424 df-sgrp 18473 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |