Theorem sgrp0 18710

Description: Any set with an empty base set and any group operation is a semigroup. (Contributed by AV, 28-Aug-2021.)

Assertion

Ref	Expression
sgrp0	⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Smgrp)

Proof of Theorem sgrp0

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mgm0 18639	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Mgm)
2		rzal 4489	. . 3 ⊢ ((Base‘𝑀) = ∅ → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
3	2	adantl 481	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
4		eqid 2736	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
5		eqid 2736	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
6	4, 5	issgrp 18703	. 2 ⊢ (𝑀 ∈ Smgrp ↔ (𝑀 ∈ Mgm ∧ ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧))))
7	1, 3, 6	sylanbrc 583	1 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Smgrp)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3052  ∅c0 4313  ‘cfv 6536  (class class class)co 7410  Basecbs 17233  +_gcplusg 17276  Mgmcmgm 18621  Smgrpcsgrp 18701

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708  ax-nul 5281

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ne 2934  df-ral 3053  df-rab 3421  df-v 3466  df-sbc 3771  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-iota 6489  df-fv 6544  df-ov 7413  df-mgm 18623  df-sgrp 18702

This theorem is referenced by: (None)