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

Theorem gsumvallem2 19023
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 18846 . 2 (𝐺 ∈ Mnd → 𝑂 ⊆ { 0 })
61, 2mndidcl 18932 . . . 4 (𝐺 ∈ Mnd → 0 ∈ 𝐵)
71, 3, 2mndlrid 18936 . . . . 5 ((𝐺 ∈ Mnd ∧ 𝑦 ∈ 𝐵) → (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
87ralrimiva 3155 . . . 4 (𝐺 ∈ Mnd → ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
9 oveq1 7425 . . . . . . 7 (𝑥 = 0 → (𝑥 + 𝑦) = ( 0 + 𝑦))
109eqeq1d 2763 . . . . . 6 (𝑥 = 0 → ((𝑥 + 𝑦) = 𝑦 ↔ ( 0 + 𝑦) = 𝑦))
1110ovanraleqv 7442 . . . . 5 (𝑥 = 0 → (∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
1211, 4elrab2 3649 . . . 4 ( 0 ∈ 𝑂 ↔ ( 0 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
136, 8, 12sylanbrc 595 . . 3 (𝐺 ∈ Mnd → 0 ∈ 𝑂)
1413snssd 4747 . 2 (𝐺 ∈ Mnd → { 0 } ⊆ 𝑂)
155, 14eqssd 3948 1 (𝐺 ∈ Mnd → 𝑂 = { 0 })
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413  {csn 4584  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +gcplusg 17421  0gc0g 17603  Mndcmnd 18916
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  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-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7375  df-ov 7421  df-0g 17605  df-mgm 18809  df-sgrp 18901  df-mnd 18917
This theorem is used by:  gsumz  19025  gsumval3a  20110
  Copyright terms: Public domain W3C validator