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

Theorem isgrp 17251
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 6103 . . . 4 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
2 isgrp.b . . . 4 𝐵 = (Base‘𝐺)
31, 2syl6eqr 2662 . . 3 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
4 fveq2 6103 . . . . . . 7 (𝑔 = 𝐺 → (+g𝑔) = (+g𝐺))
5 isgrp.p . . . . . . 7 + = (+g𝐺)
64, 5syl6eqr 2662 . . . . . 6 (𝑔 = 𝐺 → (+g𝑔) = + )
76oveqd 6566 . . . . 5 (𝑔 = 𝐺 → (𝑚(+g𝑔)𝑎) = (𝑚 + 𝑎))
8 fveq2 6103 . . . . . 6 (𝑔 = 𝐺 → (0g𝑔) = (0g𝐺))
9 isgrp.z . . . . . 6 0 = (0g𝐺)
108, 9syl6eqr 2662 . . . . 5 (𝑔 = 𝐺 → (0g𝑔) = 0 )
117, 10eqeq12d 2625 . . . 4 (𝑔 = 𝐺 → ((𝑚(+g𝑔)𝑎) = (0g𝑔) ↔ (𝑚 + 𝑎) = 0 ))
123, 11rexeqbidv 3130 . . 3 (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g𝑔)𝑎) = (0g𝑔) ↔ ∃𝑚𝐵 (𝑚 + 𝑎) = 0 ))
133, 12raleqbidv 3129 . 2 (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g𝑔)𝑎) = (0g𝑔) ↔ ∀𝑎𝐵𝑚𝐵 (𝑚 + 𝑎) = 0 ))
14 df-grp 17248 . 2 Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g𝑔)𝑎) = (0g𝑔)}
1513, 14elrab2 3333 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎𝐵𝑚𝐵 (𝑚 + 𝑎) = 0 ))
Colors of variables: wff setvar class
Syntax hints:  wb 195  wa 383   = wceq 1475  wcel 1977  wral 2896  wrex 2897  cfv 5804  (class class class)co 6549  Basecbs 15695  +gcplusg 15768  0gc0g 15923  Mndcmnd 17117  Grpcgrp 17245
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-iota 5768  df-fv 5812  df-ov 6552  df-grp 17248
This theorem is referenced by:  grpmnd  17252  grpinvex  17255  grppropd  17260  isgrpd2e  17264  grp1  17345  ghmgrp  17362  2zrngagrp  41733
  Copyright terms: Public domain W3C validator