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

Theorem ismgmid 18349
Description: The identity element of a magma, if it exists, belongs to the base set. (Contributed by Mario Carneiro, 27-Dec-2014.)
Hypotheses
Ref Expression
ismgmid.b 𝐵 = (Base‘𝐺)
ismgmid.o 0 = (0g𝐺)
ismgmid.p + = (+g𝐺)
mgmidcl.e (𝜑 → ∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
Assertion
Ref Expression
ismgmid (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ 0 = 𝑈))
Distinct variable groups:   𝑥,𝑒, +   0 ,𝑒,𝑥   𝐵,𝑒,𝑥   𝑒,𝐺,𝑥   𝑈,𝑒,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑒)

Proof of Theorem ismgmid
StepHypRef Expression
1 id 22 . . . 4 (𝑈𝐵𝑈𝐵)
2 mgmidcl.e . . . . 5 (𝜑 → ∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
3 mgmidmo 18344 . . . . 5 ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)
4 reu5 3361 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ (∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ∧ ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
52, 3, 4sylanblrc 590 . . . 4 (𝜑 → ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
6 oveq1 7282 . . . . . . 7 (𝑒 = 𝑈 → (𝑒 + 𝑥) = (𝑈 + 𝑥))
76eqeq1d 2740 . . . . . 6 (𝑒 = 𝑈 → ((𝑒 + 𝑥) = 𝑥 ↔ (𝑈 + 𝑥) = 𝑥))
87ovanraleqv 7299 . . . . 5 (𝑒 = 𝑈 → (∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)))
98riota2 7258 . . . 4 ((𝑈𝐵 ∧ ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
101, 5, 9syl2anr 597 . . 3 ((𝜑𝑈𝐵) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
1110pm5.32da 579 . 2 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
12 riotacl 7250 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
135, 12syl 17 . . . 4 (𝜑 → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
14 eleq1 2826 . . . 4 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵𝑈𝐵))
1513, 14syl5ibcom 244 . . 3 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈𝑈𝐵))
1615pm4.71rd 563 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
17 df-riota 7232 . . . . 5 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
18 ismgmid.b . . . . . 6 𝐵 = (Base‘𝐺)
19 ismgmid.p . . . . . 6 + = (+g𝐺)
20 ismgmid.o . . . . . 6 0 = (0g𝐺)
2118, 19, 20grpidval 18345 . . . . 5 0 = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
2217, 21eqtr4i 2769 . . . 4 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 0
2322eqeq1i 2743 . . 3 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈)
2423a1i 11 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈))
2511, 16, 243bitr2d 307 1 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ 0 = 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  wrex 3065  ∃!wreu 3066  ∃*wrmo 3067  cio 6389  cfv 6433  crio 7231  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  0gc0g 17150
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-riota 7232  df-ov 7278  df-0g 17152
This theorem is referenced by:  mgmidcl  18350  mgmlrid  18351  ismgmid2  18352  mgmidsssn0  18356  prds0g  18419  issrgid  19759  isringid  19812  signsw0g  32535
  Copyright terms: Public domain W3C validator