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

Theorem 0gisid 18767
Description: In a structure with an identity element, the group identity element is an identity element of the structure. (Contributed by Jeff Madsen, 8-Jun-2010.) (Revised by Mario Carneiro, 23-Dec-2013.) (Revised by AV, 11-Aug-2026.)
Hypotheses
Ref Expression
ismgmid.b 𝐵 = (Base‘𝐺)
ismgmid.o 0 = (0g𝐺)
ismgmid.p + = (+g𝐺)
mgmidcl.e (𝜑 → ∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
Assertion
Ref Expression
0gisid (𝜑 → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))
Distinct variable groups:   𝑥,𝑒, +   0 ,𝑒,𝑥   𝐵,𝑒,𝑥   𝑒,𝐺,𝑥
Allowed substitution hints:   𝜑(𝑥, 𝑒)

Proof of Theorem 0gisid
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 mgmidcl.e . 2 (𝜑 → ∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
2 oveq1 7424 . . . . . 6 (𝑒 = 𝑖 → (𝑒 + 𝑥) = (𝑖 + 𝑥))
32eqeq1d 2764 . . . . 5 (𝑒 = 𝑖 → ((𝑒 + 𝑥) = 𝑥 ↔ (𝑖 + 𝑥) = 𝑥))
43ovanraleqv 7441 . . . 4 (𝑒 = 𝑖 → (∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥)))
54cbvrexvw 3243 . . 3 (∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∃𝑖𝐵𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥))
6 ismgmid.b . . . . . . 7 𝐵 = (Base‘𝐺)
7 ismgmid.o . . . . . . 7 0 = (0g𝐺)
8 ismgmid.p . . . . . . 7 + = (+g𝐺)
96, 7, 8, 1ismgmid 18764 . . . . . 6 (𝜑 → ((𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥)) ↔ 0 = 𝑖))
109biimpa 482 . . . . 5 ((𝜑 ∧ (𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥))) → 0 = 𝑖)
11 eleq1 2850 . . . . . . . . . 10 (𝑖 = 0 → (𝑖𝐵0𝐵))
12 oveq1 7424 . . . . . . . . . . . 12 (𝑖 = 0 → (𝑖 + 𝑥) = ( 0 + 𝑥))
1312eqeq1d 2764 . . . . . . . . . . 11 (𝑖 = 0 → ((𝑖 + 𝑥) = 𝑥 ↔ ( 0 + 𝑥) = 𝑥))
1413ovanraleqv 7441 . . . . . . . . . 10 (𝑖 = 0 → (∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥) ↔ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))
1511, 14anbi12d 644 . . . . . . . . 9 (𝑖 = 0 → ((𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥)) ↔ ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
1615eqcoms 2770 . . . . . . . 8 ( 0 = 𝑖 → ((𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥)) ↔ ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
1716adantl 487 . . . . . . 7 ((𝜑0 = 𝑖) → ((𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥)) ↔ ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
1817biimpd 232 . . . . . 6 ((𝜑0 = 𝑖) → ((𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥)) → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
1918impancom 457 . . . . 5 ((𝜑 ∧ (𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥))) → ( 0 = 𝑖 → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
2010, 19mpd 16 . . . 4 ((𝜑 ∧ (𝑖𝐵 ∧ ∀𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥))) → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))
2120rexlimdvaa 3166 . . 3 (𝜑 → (∃𝑖𝐵𝑥𝐵 ((𝑖 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑖) = 𝑥) → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
225, 21biimtrid 245 . 2 (𝜑 → (∃𝑒𝐵𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))))
231, 22mpd 16 1 (𝜑 → ( 0𝐵 ∧ ∀𝑥𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3078  wrex 3088  cfv 6537  (class class class)co 7417  Basecbs 17307  +gcplusg 17348  0gc0g 17530
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7374  df-ov 7420  df-0g 17532
This theorem is used by:  idressidex0  18779  idressid  18781
  Copyright terms: Public domain W3C validator