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

Theorem ismgmid 18590
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 18585 . . . . 5 ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)
4 reu5 3376 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ (∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ∧ ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
52, 3, 4sylanblrc 588 . . . 4 (𝜑 → ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
6 oveq1 7418 . . . . . . 7 (𝑒 = 𝑈 → (𝑒 + 𝑥) = (𝑈 + 𝑥))
76eqeq1d 2732 . . . . . 6 (𝑒 = 𝑈 → ((𝑒 + 𝑥) = 𝑥 ↔ (𝑈 + 𝑥) = 𝑥))
87ovanraleqv 7435 . . . . 5 (𝑒 = 𝑈 → (∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)))
98riota2 7393 . . . 4 ((𝑈𝐵 ∧ ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
101, 5, 9syl2anr 595 . . 3 ((𝜑𝑈𝐵) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
1110pm5.32da 577 . 2 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
12 riotacl 7385 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
135, 12syl 17 . . . 4 (𝜑 → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
14 eleq1 2819 . . . 4 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵𝑈𝐵))
1513, 14syl5ibcom 244 . . 3 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈𝑈𝐵))
1615pm4.71rd 561 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
17 df-riota 7367 . . . . 5 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
18 ismgmid.b . . . . . 6 𝐵 = (Base‘𝐺)
19 ismgmid.p . . . . . 6 + = (+g𝐺)
20 ismgmid.o . . . . . 6 0 = (0g𝐺)
2118, 19, 20grpidval 18586 . . . . 5 0 = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
2217, 21eqtr4i 2761 . . . 4 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 0
2322eqeq1i 2735 . . 3 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈)
2423a1i 11 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈))
2511, 16, 243bitr2d 306 1 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ 0 = 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394   = wceq 1539  wcel 2104  wral 3059  wrex 3068  ∃!wreu 3372  ∃*wrmo 3373  cio 6492  cfv 6542  crio 7366  (class class class)co 7411  Basecbs 17148  +gcplusg 17201  0gc0g 17389
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-iota 6494  df-fun 6544  df-fv 6550  df-riota 7367  df-ov 7414  df-0g 17391
This theorem is referenced by:  mgmidcl  18591  mgmlrid  18592  ismgmid2  18593  mgmidsssn0  18597  prds0g  18693  issrgid  20098  isringid  20159  signsw0g  33865
  Copyright terms: Public domain W3C validator