MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  gsumvallem2 Structured version   Visualization version   GIF version

Theorem gsumvallem2 18930
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
StepHypRef Expression
1 gsumvallem2.b . . 3 𝐵 = (Base‘𝐺)
2 gsumvallem2.z . . 3 0 = (0g𝐺)
3 gsumvallem2.p . . 3 + = (+g𝐺)
4 gsumvallem2.o . . 3 𝑂 = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)}
51, 2, 3, 4mgmidsssn0 18756 . 2 (𝐺 ∈ Mnd → 𝑂 ⊆ { 0 })
61, 2mndidcl 18840 . . . 4 (𝐺 ∈ Mnd → 0𝐵)
71, 3, 2mndlrid 18844 . . . . 5 ((𝐺 ∈ Mnd ∧ 𝑦𝐵) → (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
87ralrimiva 3159 . . . 4 (𝐺 ∈ Mnd → ∀𝑦𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
9 oveq1 7426 . . . . . . 7 (𝑥 = 0 → (𝑥 + 𝑦) = ( 0 + 𝑦))
109eqeq1d 2767 . . . . . 6 (𝑥 = 0 → ((𝑥 + 𝑦) = 𝑦 ↔ ( 0 + 𝑦) = 𝑦))
1110ovanraleqv 7443 . . . . 5 (𝑥 = 0 → (∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ ∀𝑦𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
1211, 4elrab2 3656 . . . 4 ( 0𝑂 ↔ ( 0𝐵 ∧ ∀𝑦𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
136, 8, 12sylanbrc 595 . . 3 (𝐺 ∈ Mnd → 0𝑂)
1413snssd 4754 . 2 (𝐺 ∈ Mnd → { 0 } ⊆ 𝑂)
155, 14eqssd 3955 1 (𝐺 ∈ Mnd → 𝑂 = { 0 })
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wral 3081  {crab 3418  {csn 4591  cfv 6540  (class class class)co 7419  Basecbs 17291  +gcplusg 17332  0gc0g 17514  Mndcmnd 18824
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-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  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-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-riota 7376  df-ov 7422  df-0g 17516  df-mgm 18720  df-sgrp 18809  df-mnd 18825
This theorem is used by:  gsumz  18932  gsumval3a  20017
  Copyright terms: Public domain W3C validator