ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  gsumvallem2 GIF version

Theorem gsumvallem2 13197
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 13088 . 2 (𝐺 ∈ Mnd → 𝑂 ⊆ { 0 })
61, 2mndidcl 13134 . . . 4 (𝐺 ∈ Mnd → 0𝐵)
71, 3, 2mndlrid 13138 . . . . 5 ((𝐺 ∈ Mnd ∧ 𝑦𝐵) → (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
87ralrimiva 2570 . . . 4 (𝐺 ∈ Mnd → ∀𝑦𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦))
9 oveq1 5932 . . . . . . 7 (𝑥 = 0 → (𝑥 + 𝑦) = ( 0 + 𝑦))
109eqeq1d 2205 . . . . . 6 (𝑥 = 0 → ((𝑥 + 𝑦) = 𝑦 ↔ ( 0 + 𝑦) = 𝑦))
1110ovanraleqv 5949 . . . . 5 (𝑥 = 0 → (∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) ↔ ∀𝑦𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
1211, 4elrab2 2923 . . . 4 ( 0𝑂 ↔ ( 0𝐵 ∧ ∀𝑦𝐵 (( 0 + 𝑦) = 𝑦 ∧ (𝑦 + 0 ) = 𝑦)))
136, 8, 12sylanbrc 417 . . 3 (𝐺 ∈ Mnd → 0𝑂)
1413snssd 3768 . 2 (𝐺 ∈ Mnd → { 0 } ⊆ 𝑂)
155, 14eqssd 3201 1 (𝐺 ∈ Mnd → 𝑂 = { 0 })
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2167  wral 2475  {crab 2479  {csn 3623  cfv 5259  (class class class)co 5925  Basecbs 12705  +gcplusg 12782  0gc0g 12960  Mndcmnd 13120
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7989  ax-resscn 7990  ax-1re 7992  ax-addrcl 7995
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-riota 5880  df-ov 5928  df-inn 9010  df-2 9068  df-ndx 12708  df-slot 12709  df-base 12711  df-plusg 12795  df-0g 12962  df-mgm 13060  df-sgrp 13106  df-mnd 13121
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator