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

Theorem grpidval 17865
Description: The value of the identity element of a group. (Contributed by NM, 20-Aug-2011.) (Revised by Mario Carneiro, 2-Oct-2015.)
Hypotheses
Ref Expression
grpidval.b 𝐵 = (Base‘𝐺)
grpidval.p + = (+g𝐺)
grpidval.o 0 = (0g𝐺)
Assertion
Ref Expression
grpidval 0 = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
Distinct variable groups:   𝑥,𝑒,𝐵   𝑒,𝐺,𝑥
Allowed substitution hints:   + (𝑥,𝑒)   0 (𝑥,𝑒)

Proof of Theorem grpidval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 grpidval.o . 2 0 = (0g𝐺)
2 fveq2 6664 . . . . . . . 8 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3 grpidval.b . . . . . . . 8 𝐵 = (Base‘𝐺)
42, 3syl6eqr 2874 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
54eleq2d 2898 . . . . . 6 (𝑔 = 𝐺 → (𝑒 ∈ (Base‘𝑔) ↔ 𝑒𝐵))
6 fveq2 6664 . . . . . . . . . . 11 (𝑔 = 𝐺 → (+g𝑔) = (+g𝐺))
7 grpidval.p . . . . . . . . . . 11 + = (+g𝐺)
86, 7syl6eqr 2874 . . . . . . . . . 10 (𝑔 = 𝐺 → (+g𝑔) = + )
98oveqd 7167 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑒(+g𝑔)𝑥) = (𝑒 + 𝑥))
109eqeq1d 2823 . . . . . . . 8 (𝑔 = 𝐺 → ((𝑒(+g𝑔)𝑥) = 𝑥 ↔ (𝑒 + 𝑥) = 𝑥))
118oveqd 7167 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥(+g𝑔)𝑒) = (𝑥 + 𝑒))
1211eqeq1d 2823 . . . . . . . 8 (𝑔 = 𝐺 → ((𝑥(+g𝑔)𝑒) = 𝑥 ↔ (𝑥 + 𝑒) = 𝑥))
1310, 12anbi12d 632 . . . . . . 7 (𝑔 = 𝐺 → (((𝑒(+g𝑔)𝑥) = 𝑥 ∧ (𝑥(+g𝑔)𝑒) = 𝑥) ↔ ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
144, 13raleqbidv 3401 . . . . . 6 (𝑔 = 𝐺 → (∀𝑥 ∈ (Base‘𝑔)((𝑒(+g𝑔)𝑥) = 𝑥 ∧ (𝑥(+g𝑔)𝑒) = 𝑥) ↔ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
155, 14anbi12d 632 . . . . 5 (𝑔 = 𝐺 → ((𝑒 ∈ (Base‘𝑔) ∧ ∀𝑥 ∈ (Base‘𝑔)((𝑒(+g𝑔)𝑥) = 𝑥 ∧ (𝑥(+g𝑔)𝑒) = 𝑥)) ↔ (𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))))
1615iotabidv 6333 . . . 4 (𝑔 = 𝐺 → (℩𝑒(𝑒 ∈ (Base‘𝑔) ∧ ∀𝑥 ∈ (Base‘𝑔)((𝑒(+g𝑔)𝑥) = 𝑥 ∧ (𝑥(+g𝑔)𝑒) = 𝑥))) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))))
17 df-0g 16709 . . . 4 0g = (𝑔 ∈ V ↦ (℩𝑒(𝑒 ∈ (Base‘𝑔) ∧ ∀𝑥 ∈ (Base‘𝑔)((𝑒(+g𝑔)𝑥) = 𝑥 ∧ (𝑥(+g𝑔)𝑒) = 𝑥))))
18 iotaex 6329 . . . 4 (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))) ∈ V
1916, 17, 18fvmpt 6762 . . 3 (𝐺 ∈ V → (0g𝐺) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))))
20 fvprc 6657 . . . 4 𝐺 ∈ V → (0g𝐺) = ∅)
21 euex 2658 . . . . . . 7 (∃!𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → ∃𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
22 n0i 4298 . . . . . . . . . 10 (𝑒𝐵 → ¬ 𝐵 = ∅)
23 fvprc 6657 . . . . . . . . . . 11 𝐺 ∈ V → (Base‘𝐺) = ∅)
243, 23syl5eq 2868 . . . . . . . . . 10 𝐺 ∈ V → 𝐵 = ∅)
2522, 24nsyl2 143 . . . . . . . . 9 (𝑒𝐵𝐺 ∈ V)
2625adantr 483 . . . . . . . 8 ((𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → 𝐺 ∈ V)
2726exlimiv 1927 . . . . . . 7 (∃𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → 𝐺 ∈ V)
2821, 27syl 17 . . . . . 6 (∃!𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → 𝐺 ∈ V)
2928con3i 157 . . . . 5 𝐺 ∈ V → ¬ ∃!𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
30 iotanul 6327 . . . . 5 (¬ ∃!𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)) → (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))) = ∅)
3129, 30syl 17 . . . 4 𝐺 ∈ V → (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))) = ∅)
3220, 31eqtr4d 2859 . . 3 𝐺 ∈ V → (0g𝐺) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))))
3319, 32pm2.61i 184 . 2 (0g𝐺) = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
341, 33eqtri 2844 1 0 = (℩𝑒(𝑒𝐵 ∧ ∀𝑥𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 398   = wceq 1533  wex 1776  wcel 2110  ∃!weu 2649  wral 3138  Vcvv 3494  c0 4290  cio 6306  cfv 6349  (class class class)co 7150  Basecbs 16477  +gcplusg 16559  0gc0g 16707
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fv 6357  df-ov 7153  df-0g 16709
This theorem is referenced by:  grpidpropd  17866  0g0  17868  ismgmid  17869  sgrpidmnd  17910  oppgid  18478  dfur2  19248  oppr0  19377  oppr1  19378
  Copyright terms: Public domain W3C validator