Theorem sgrpidmnd 18632

Description: A semigroup with an identity element which is not the empty set is a monoid. Of course there could be monoids with the empty set as identity element (see, for example, the monoid of the power set of a class under union, pwmnd 18820 and pwmndid 18819), but these cannot be proven to be monoids with this theorem. (Contributed by AV, 29-Jan-2024.)

Hypotheses

Ref	Expression
sgrpidmnd.b	⊢ 𝐵 = (Base‘𝐺)
sgrpidmnd.0	⊢ 0 = (0g‘𝐺)

Assertion

Ref	Expression
sgrpidmnd	⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑒 ∈ 𝐵 (𝑒 ≠ ∅ ∧ 𝑒 = 0 )) → 𝐺 ∈ Mnd)

Distinct variable groups:   𝐵,𝑒   𝑒,𝐺

Allowed substitution hint:   0 (𝑒)

Proof of Theorem sgrpidmnd

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

Step	Hyp	Ref	Expression
1		sgrpidmnd.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐺)
2		eqid 2732	. . . . . . . . . 10 ⊢ (+g‘𝐺) = (+g‘𝐺)
3		sgrpidmnd.0	. . . . . . . . . 10 ⊢ 0 = (0g‘𝐺)
4	1, 2, 3	grpidval 18582	. . . . . . . . 9 ⊢ 0 = (℩𝑦(𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥)))
5	4	eqeq2i 2745	. . . . . . . 8 ⊢ (𝑒 = 0 ↔ 𝑒 = (℩𝑦(𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥))))
6		eleq1w 2816	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑒 → (𝑦 ∈ 𝐵 ↔ 𝑒 ∈ 𝐵))
7		oveq1 7418	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑒 → (𝑦(+g‘𝐺)𝑥) = (𝑒(+g‘𝐺)𝑥))
8	7	eqeq1d 2734	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑒 → ((𝑦(+g‘𝐺)𝑥) = 𝑥 ↔ (𝑒(+g‘𝐺)𝑥) = 𝑥))
9	8	ovanraleqv 7435	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑒 → (∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
10	6, 9	anbi12d 631	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑒 → ((𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥)) ↔ (𝑒 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥))))
11	10	iotan0 6533	. . . . . . . . . . 11 ⊢ ((𝑒 ∈ 𝐵 ∧ 𝑒 ≠ ∅ ∧ 𝑒 = (℩𝑦(𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥)))) → (𝑒 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
12		rsp 3244	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥) → (𝑥 ∈ 𝐵 → ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
13	11, 12	simpl2im 504	. . . . . . . . . 10 ⊢ ((𝑒 ∈ 𝐵 ∧ 𝑒 ≠ ∅ ∧ 𝑒 = (℩𝑦(𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥)))) → (𝑥 ∈ 𝐵 → ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
14	13	3expb 1120	. . . . . . . . 9 ⊢ ((𝑒 ∈ 𝐵 ∧ (𝑒 ≠ ∅ ∧ 𝑒 = (℩𝑦(𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥))))) → (𝑥 ∈ 𝐵 → ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
15	14	expcom 414	. . . . . . . 8 ⊢ ((𝑒 ≠ ∅ ∧ 𝑒 = (℩𝑦(𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝑦(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑦) = 𝑥)))) → (𝑒 ∈ 𝐵 → (𝑥 ∈ 𝐵 → ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥))))
16	5, 15	sylan2b 594	. . . . . . 7 ⊢ ((𝑒 ≠ ∅ ∧ 𝑒 = 0 ) → (𝑒 ∈ 𝐵 → (𝑥 ∈ 𝐵 → ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥))))
17	16	impcom 408	. . . . . 6 ⊢ ((𝑒 ∈ 𝐵 ∧ (𝑒 ≠ ∅ ∧ 𝑒 = 0 )) → (𝑥 ∈ 𝐵 → ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
18	17	ralrimiv 3145	. . . . 5 ⊢ ((𝑒 ∈ 𝐵 ∧ (𝑒 ≠ ∅ ∧ 𝑒 = 0 )) → ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥))
19	18	ex 413	. . . 4 ⊢ (𝑒 ∈ 𝐵 → ((𝑒 ≠ ∅ ∧ 𝑒 = 0 ) → ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
20	19	reximia 3081	. . 3 ⊢ (∃𝑒 ∈ 𝐵 (𝑒 ≠ ∅ ∧ 𝑒 = 0 ) → ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥))
21	20	anim2i 617	. 2 ⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑒 ∈ 𝐵 (𝑒 ≠ ∅ ∧ 𝑒 = 0 )) → (𝐺 ∈ Smgrp ∧ ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
22	1, 2	ismnddef 18629	. 2 ⊢ (𝐺 ∈ Mnd ↔ (𝐺 ∈ Smgrp ∧ ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑒) = 𝑥)))
23	21, 22	sylibr 233	1 ⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑒 ∈ 𝐵 (𝑒 ≠ ∅ ∧ 𝑒 = 0 )) → 𝐺 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  ∅c0 4322  ℩cio 6493  ‘cfv 6543  (class class class)co 7411  Basecbs 17146  +_gcplusg 17199  0_gc0g 17387  Smgrpcsgrp 18611  Mndcmnd 18627

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-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-iota 6495  df-fun 6545  df-fv 6551  df-ov 7414  df-0g 17389  df-mnd 18628

This theorem is referenced by: (None)