Theorem copissgrp 49083

Description: A structure with a constant group addition operation is a semigroup if the constant is contained in the base set. (Contributed by AV, 16-Feb-2020.)

Hypotheses

Ref	Expression
copissgrp.b	⊢ 𝐵 = (Base‘𝑀)
copissgrp.p	⊢ (+g‘𝑀) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)
copissgrp.n	⊢ (𝜑 → 𝐵 ≠ ∅)
copissgrp.c	⊢ (𝜑 → 𝐶 ∈ 𝐵)

Assertion

Ref	Expression
copissgrp	⊢ (𝜑 → 𝑀 ∈ Smgrp)

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝑀   𝜑,𝑥,𝑦

Allowed substitution hint:   𝑀(𝑦)

Proof of Theorem copissgrp

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		copissgrp.b	. . 3 ⊢ 𝐵 = (Base‘𝑀)
2		copissgrp.p	. . 3 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)
3		copissgrp.n	. . 3 ⊢ (𝜑 → 𝐵 ≠ ∅)
4		copissgrp.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝐵)
5	4	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐵)
6	1, 2, 3, 5	opmpoismgm 49082	. 2 ⊢ (𝜑 → 𝑀 ∈ Mgm)
7		eqidd 2761	. . . . . . 7 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶))
8		eqidd 2761	. . . . . . 7 ⊢ (((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝐶 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
9		simpl 488	. . . . . . 7 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝐶 ∈ 𝐵)
10		simpr3 1215	. . . . . . 7 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑐 ∈ 𝐵)
11	7, 8, 9, 10, 9	ovmpod 7565	. . . . . 6 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
12		eqidd 2761	. . . . . . 7 ⊢ (((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝐶)) → 𝐶 = 𝐶)
13		simpr1 1213	. . . . . . 7 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
14	7, 12, 13, 9, 9	ovmpod 7565	. . . . . 6 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝐶) = 𝐶)
15	11, 14	eqtr4d 2798	. . . . 5 ⊢ ((𝐶 ∈ 𝐵 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝐶))
16	4, 15	sylan 592	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝐶))
17		eqidd 2761	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶))
18		eqidd 2761	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑏)) → 𝐶 = 𝐶)
19		simpr1 1213	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
20		simpr2 1214	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
21	4	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝐶 ∈ 𝐵)
22	17, 18, 19, 20, 21	ovmpod 7565	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏) = 𝐶)
23	22	oveq1d 7428	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = (𝐶(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))
24		eqidd 2761	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑏 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
25		simpr3 1215	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑐 ∈ 𝐵)
26	17, 24, 20, 25, 21	ovmpod 7565	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
27	26	oveq2d 7429	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝐶))
28	16, 23, 27	3eqtr4d 2805	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
29	28	ralrimivvva 3208	. 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
30	2	eqcomi 2769	. . 3 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (+g‘𝑀)
31	1, 30	issgrp 18822	. 2 ⊢ (𝑀 ∈ Smgrp ↔ (𝑀 ∈ Mgm ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
32	6, 29, 31	sylanbrc 595	1 ⊢ (𝜑 → 𝑀 ∈ Smgrp)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076  ∅c0 4279  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  Basecbs 17301  +_gcplusg 17342  Mgmcmgm 18728  Smgrpcsgrp 18820

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736

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-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-mgm 18730  df-sgrp 18821

This theorem is used by:  cznrng  49176