Theorem sgrp0 18925

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 18843	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Mgm)
2		rzal 4449	. . 3 ⊢ ((Base‘𝑀) = ∅ → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
3	2	adantl 487	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
4		eqid 2760	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
5		eqid 2760	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
6	4, 5	issgrp 18918	. 2 ⊢ (𝑀 ∈ Smgrp ↔ (𝑀 ∈ Mgm ∧ ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧))))
7	1, 3, 6	sylanbrc 595	1 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Smgrp)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∅c0 4277  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  +_gcplusg 17437  Mgmcmgm 18823  Smgrpcsgrp 18916

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6497  df-fv 6551  df-ov 7427  df-mgm 18825  df-sgrp 18917

This theorem is used by: (None)