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

Theorem mgmidsssn0 17269
Description: Property of the set of identities of 𝐺. Either 𝐺 has no identities, and 𝑂 = ∅, or it has one and this identity is unique and identified by the 0g function. (Contributed by Mario Carneiro, 7-Dec-2014.)
Hypotheses
Ref Expression
mgmidsssn0.b 𝐵 = (Base‘𝐺)
mgmidsssn0.z 0 = (0g𝐺)
mgmidsssn0.p + = (+g𝐺)
mgmidsssn0.o 𝑂 = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)}
Assertion
Ref Expression
mgmidsssn0 (𝐺𝑉𝑂 ⊆ { 0 })
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐺,𝑦   𝑥, + ,𝑦   𝑥,𝑉   𝑥, 0 ,𝑦
Allowed substitution hints:   𝑂(𝑥,𝑦)   𝑉(𝑦)

Proof of Theorem mgmidsssn0
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 mgmidsssn0.o . 2 𝑂 = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)}
2 simpr 477 . . . . . . . 8 ((𝐺𝑉 ∧ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦))) → (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)))
3 mgmidsssn0.b . . . . . . . . 9 𝐵 = (Base‘𝐺)
4 mgmidsssn0.z . . . . . . . . 9 0 = (0g𝐺)
5 mgmidsssn0.p . . . . . . . . 9 + = (+g𝐺)
6 oveq1 6657 . . . . . . . . . . . . . 14 (𝑧 = 𝑥 → (𝑧 + 𝑦) = (𝑥 + 𝑦))
76eqeq1d 2624 . . . . . . . . . . . . 13 (𝑧 = 𝑥 → ((𝑧 + 𝑦) = 𝑦 ↔ (𝑥 + 𝑦) = 𝑦))
8 oveq2 6658 . . . . . . . . . . . . . 14 (𝑧 = 𝑥 → (𝑦 + 𝑧) = (𝑦 + 𝑥))
98eqeq1d 2624 . . . . . . . . . . . . 13 (𝑧 = 𝑥 → ((𝑦 + 𝑧) = 𝑦 ↔ (𝑦 + 𝑥) = 𝑦))
107, 9anbi12d 747 . . . . . . . . . . . 12 (𝑧 = 𝑥 → (((𝑧 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑧) = 𝑦) ↔ ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)))
1110ralbidv 2986 . . . . . . . . . . 11 (𝑧 = 𝑥 → (∀𝑦𝐵 ((𝑧 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑧) = 𝑦) ↔ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)))
1211rspcev 3309 . . . . . . . . . 10 ((𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)) → ∃𝑧𝐵𝑦𝐵 ((𝑧 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑧) = 𝑦))
1312adantl 482 . . . . . . . . 9 ((𝐺𝑉 ∧ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦))) → ∃𝑧𝐵𝑦𝐵 ((𝑧 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑧) = 𝑦))
143, 4, 5, 13ismgmid 17264 . . . . . . . 8 ((𝐺𝑉 ∧ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦))) → ((𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)) ↔ 0 = 𝑥))
152, 14mpbid 222 . . . . . . 7 ((𝐺𝑉 ∧ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦))) → 0 = 𝑥)
1615eqcomd 2628 . . . . . 6 ((𝐺𝑉 ∧ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦))) → 𝑥 = 0 )
17 velsn 4193 . . . . . 6 (𝑥 ∈ { 0 } ↔ 𝑥 = 0 )
1816, 17sylibr 224 . . . . 5 ((𝐺𝑉 ∧ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦))) → 𝑥 ∈ { 0 })
1918expr 643 . . . 4 ((𝐺𝑉𝑥𝐵) → (∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) → 𝑥 ∈ { 0 }))
2019ralrimiva 2966 . . 3 (𝐺𝑉 → ∀𝑥𝐵 (∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) → 𝑥 ∈ { 0 }))
21 rabss 3679 . . 3 ({𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)} ⊆ { 0 } ↔ ∀𝑥𝐵 (∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦) → 𝑥 ∈ { 0 }))
2220, 21sylibr 224 . 2 (𝐺𝑉 → {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 + 𝑦) = 𝑦 ∧ (𝑦 + 𝑥) = 𝑦)} ⊆ { 0 })
231, 22syl5eqss 3649 1 (𝐺𝑉𝑂 ⊆ { 0 })
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  wral 2912  wrex 2913  {crab 2916  wss 3574  {csn 4177  cfv 5888  (class class class)co 6650  Basecbs 15857  +gcplusg 15941  0gc0g 16100
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896  df-riota 6611  df-ov 6653  df-0g 16102
This theorem is referenced by:  gsumress  17276  gsumval2  17280  gsumvallem2  17372
  Copyright terms: Public domain W3C validator