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

Theorem isgrp 19155
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 6885 . . . 4 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
2 isgrp.b . . . 4 𝐵 = (Base‘𝐺)
31, 2eqtr4di 2813 . . 3 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
4 fveq2 6885 . . . . . . 7 (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
5 isgrp.p . . . . . . 7 + = (+g‘𝐺)
64, 5eqtr4di 2813 . . . . . 6 (𝑔 = 𝐺 → (+g‘𝑔) = + )
76oveqd 7437 . . . . 5 (𝑔 = 𝐺 → (𝑚(+g‘𝑔)𝑎) = (𝑚 + 𝑎))
8 fveq2 6885 . . . . . 6 (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
9 isgrp.z . . . . . 6 0 = (0g‘𝐺)
108, 9eqtr4di 2813 . . . . 5 (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
117, 10eqeq12d 2776 . . . 4 (𝑔 = 𝐺 → ((𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ (𝑚 + 𝑎) = 0 ))
123, 11rexeqbidv 3335 . . 3 (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
133, 12raleqbidv 3334 . 2 (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
14 df-grp 19152 . 2 Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔)}
1513, 14elrab2 3648 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  +gcplusg 17433  0gc0g 17615  Mndcmnd 18928  Grpcgrp 19149
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546  df-ov 7423  df-grp 19152
This theorem is used by:  grpmnd  19156  grpinvex  19159  grppropd  19167  isgrpd2e  19171  grp1  19262  ghmgrp  19281  primrootsunit1  43240  2zrngagrp  49439
  Copyright terms: Public domain W3C validator