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

Theorem isgrp 19182
Description: The predicate "is a group". (This theorem demonstrates the use of symbols as variable names, first proposed by FL in 2010.) (Contributed by NM, 17-Oct-2012.) (Revised by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
isgrp.b 𝐵 = (Base‘𝐺)
isgrp.p + = (+g‘𝐺)
isgrp.z 0 = (0g‘𝐺)
Assertion
Ref Expression
isgrp (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
Distinct variable groups:   𝑚,𝑎,𝐵   𝐺,𝑎,𝑚
Allowed substitution hints:   + (𝑚, 𝑎)   0 (𝑚, 𝑎)

Proof of Theorem isgrp
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6911 . . . 4 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
2 isgrp.b . . . 4 𝐵 = (Base‘𝐺)
31, 2eqtr4di 2816 . . 3 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
4 fveq2 6911 . . . . . . 7 (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
5 isgrp.p . . . . . . 7 + = (+g‘𝐺)
64, 5eqtr4di 2816 . . . . . 6 (𝑔 = 𝐺 → (+g‘𝑔) = + )
76oveqd 7463 . . . . 5 (𝑔 = 𝐺 → (𝑚(+g‘𝑔)𝑎) = (𝑚 + 𝑎))
8 fveq2 6911 . . . . . 6 (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
9 isgrp.z . . . . . 6 0 = (0g‘𝐺)
108, 9eqtr4di 2816 . . . . 5 (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
117, 10eqeq12d 2779 . . . 4 (𝑔 = 𝐺 → ((𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ (𝑚 + 𝑎) = 0 ))
123, 11rexeqbidv 3339 . . 3 (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
133, 12raleqbidv 3338 . 2 (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
14 df-grp 19179 . 2 Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔)}
1513, 14elrab2 3652 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  +gcplusg 17460  0gc0g 17642  Mndcmnd 18955  Grpcgrp 19176
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-ov 7449  df-grp 19179
This theorem is used by:  grpmnd  19183  grpinvex  19186  grppropd  19194  isgrpd2e  19198  grp1  19289  ghmgrp  19308  primrootsunit1  43350  2zrngagrp  49561
  Copyright terms: Public domain W3C validator