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

Theorem ismgmid 17863
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 17858 . . . . 5 ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)
4 reu5 3428 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ (∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ∧ ∃*𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
52, 3, 4sylanblrc 590 . . . 4 (𝜑 → ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
6 oveq1 7152 . . . . . . 7 (𝑒 = 𝑈 → (𝑒 + 𝑥) = (𝑈 + 𝑥))
76eqeq1d 2820 . . . . . 6 (𝑒 = 𝑈 → ((𝑒 + 𝑥) = 𝑥 ↔ (𝑈 + 𝑥) = 𝑥))
87ovanraleqv 7169 . . . . 5 (𝑒 = 𝑈 → (∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)))
98riota2 7128 . . . 4 ((𝑈𝐵 ∧ ∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
101, 5, 9syl2anr 596 . . 3 ((𝜑𝑈𝐵) → (∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥) ↔ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈))
1110pm5.32da 579 . 2 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
12 riotacl 7120 . . . . 5 (∃!𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
135, 12syl 17 . . . 4 (𝜑 → (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵)
14 eleq1 2897 . . . 4 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) ∈ 𝐵𝑈𝐵))
1513, 14syl5ibcom 246 . . 3 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈𝑈𝐵))
1615pm4.71rd 563 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈 ↔ (𝑈𝐵 ∧ (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈)))
17 df-riota 7103 . . . . 5 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
18 ismgmid.b . . . . . 6 𝐵 = (Base‘𝐺)
19 ismgmid.p . . . . . 6 + = (+g𝐺)
20 ismgmid.o . . . . . 6 0 = (0g𝐺)
2118, 19, 20grpidval 17859 . . . . 5 0 = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
2217, 21eqtr4i 2844 . . . 4 (𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 0
2322eqeq1i 2823 . . 3 ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈)
2423a1i 11 . 2 (𝜑 → ((𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) = 𝑈0 = 𝑈))
2511, 16, 243bitr2d 308 1 (𝜑 → ((𝑈𝐵 ∧ ∀𝑥𝐵 ((𝑈 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑈) = 𝑥)) ↔ 0 = 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wcel 2105  wral 3135  wrex 3136  ∃!wreu 3137  ∃*wrmo 3138  cio 6305  cfv 6348  crio 7102  (class class class)co 7145  Basecbs 16471  +gcplusg 16553  0gc0g 16701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-rex 3141  df-reu 3142  df-rmo 3143  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fv 6356  df-riota 7103  df-ov 7148  df-0g 16703
This theorem is referenced by:  mgmidcl  17864  mgmlrid  17865  ismgmid2  17866  mgmidsssn0  17870  prds0g  17933  issrgid  19202  isringid  19252  signsw0g  31725
  Copyright terms: Public domain W3C validator