Theorem gsumvallem2 13802

Description: Lemma for properties of the set of identities of 𝐺. The set of identities of a monoid is exactly the unique identity element. (Contributed by Mario Carneiro, 7-Dec-2014.)

Hypotheses

Ref	Expression
gsumvallem2.b	⊢ 𝐵 = (Base‘𝐺)
gsumvallem2.z	⊢ 0 = (0g‘𝐺)
gsumvallem2.p	⊢ + = (+g‘𝐺)
gsumvallem2.o	⊢ 𝑂 = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)}

Assertion

Ref	Expression
gsumvallem2	⊢ (𝐺 ∈ Mnd → 𝑂 = { 0 })

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐺,𝑦   𝑥, + ,𝑦   𝑥, 0 ,𝑦

Allowed substitution hints:   𝑂(𝑥, 𝑦)

Proof of Theorem gsumvallem2

Step	Hyp	Ref	Expression
1		gsumvallem2.b	. . 3 ⊢ 𝐵 = (Base‘𝐺)
2		gsumvallem2.z	. . 3 ⊢ 0 = (0g‘𝐺)
3		gsumvallem2.p	. . 3 ⊢ + = (+g‘𝐺)
4		gsumvallem2.o	. . 3 ⊢ 𝑂 = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)}
5	1, 2, 3, 4	mgmidsssn0 13706	. 2 ⊢ (𝐺 ∈ Mnd → 𝑂 ⊆ { 0 })
6	1, 2	mndidcl 13745	. . . 4 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝐵)
7	1, 3, 2	mndlrid 13749	. . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ 𝐵) → (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
8	7	ralrimiva 2623	. . . 4 ⊢ (𝐺 ∈ Mnd → ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
9		oveq1 6092	. . . . . . 7 ⊢ (𝑥 = 0 → (𝑥 + 𝑦) = ( 0 + 𝑦))
10	9	eqeq1d 2247	. . . . . 6 ⊢ (𝑥 = 0 → ((𝑥 + 𝑦) = 𝑦 ↔ ( 0 + 𝑦) = 𝑦))
11	10	ovanraleqv 6109	. . . . 5 ⊢ (𝑥 = 0 → (∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
12	11, 4	elrab2 2985	. . . 4 ⊢ ( 0 ∈ 𝑂 ↔ ( 0 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
13	6, 8, 12	sylanbrc 421	. . 3 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝑂)
14	13	snssd 3860	. 2 ⊢ (𝐺 ∈ Mnd → { 0 } ⊆ 𝑂)
15	5, 14	eqssd 3265	1 ⊢ (𝐺 ∈ Mnd → 𝑂 = { 0 })

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  {crab 2532  {csn 3709  ‘cfv 5377  (class class class)co 6085  Basecbs 13354  +_gcplusg 13433  0_gc0g 13612  Mndcmnd 13731

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-inn 9306  df-2 9364  df-ndx 13357  df-slot 13358  df-base 13360  df-plusg 13446  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732

This theorem is used by: (None)