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

Theorem ismgmid 18633
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 18628 . . . . 5 ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)
4 reu5 3344 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ (∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ∧ ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
52, 3, 4sylanblrc 591 . . . 4 (𝜑 → ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
6 oveq1 7374 . . . . . . 7 (𝑒 = 𝑈 → (𝑒 + 𝑥) = (𝑈 + 𝑥))
76eqeq1d 2738 . . . . . 6 (𝑒 = 𝑈 → ((𝑒 + 𝑥) = 𝑥 ↔ (𝑈 + 𝑥) = 𝑥))
87ovanraleqv 7391 . . . . 5 (𝑒 = 𝑈 → (∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)))
98riota2 7349 . . . 4 ((𝑈𝐵 ∧ ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
101, 5, 9syl2anr 598 . . 3 ((𝜑𝑈𝐵) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
1110pm5.32da 579 . 2 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
12 riotacl 7341 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
135, 12syl 17 . . . 4 (𝜑 → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
14 eleq1 2824 . . . 4 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵𝑈𝐵))
1513, 14syl5ibcom 245 . . 3 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈𝑈𝐵))
1615pm4.71rd 562 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
17 df-riota 7324 . . . . 5 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
18 ismgmid.b . . . . . 6 𝐵 = (Base‘𝐺)
19 ismgmid.p . . . . . 6 + = (+g𝐺)
20 ismgmid.o . . . . . 6 0 = (0g𝐺)
2118, 19, 20grpidval 18629 . . . . 5 0 = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
2217, 21eqtr4i 2762 . . . 4 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 0
2322eqeq1i 2741 . . 3 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈)
2423a1i 11 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈))
2511, 16, 243bitr2d 307 1 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ 0 = 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3051  wrex 3061  ∃!wreu 3340  ∃*wrmo 3341  cio 6452  cfv 6498  crio 7323  (class class class)co 7367  Basecbs 17179  +gcplusg 17220  0gc0g 17402
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-riota 7324  df-ov 7370  df-0g 17404
This theorem is referenced by:  mgmidcl  18634  mgmlrid  18635  ismgmid2  18636  mgmidsssn0  18640  prds0g  18739  issrgid  20185  isringid  20252  signsw0g  34700
  Copyright terms: Public domain W3C validator