Theorem sgrp0 18817

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 18738	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → 𝑀 ∈ Mgm)
2		rzal 4457	. . 3 ⊢ ((Base‘𝑀) = ∅ → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
3	2	adantl 487	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (Base‘𝑀) = ∅) → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
4		eqid 2765	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
5		eqid 2765	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
6	4, 5	issgrp 18810	. 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 1570   ∈ wcel 2146  ∀wral 3081  ∅c0 4286  ‘cfv 6540  (class class class)co 7419  Basecbs 17291  +_gcplusg 17332  Mgmcmgm 18718  Smgrpcsgrp 18808

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-nul 5271

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-mgm 18720  df-sgrp 18809

This theorem is used by: (None)