ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isgrp GIF version

Theorem isgrp 13864
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 5695 . . . 4 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
2 isgrp.b . . . 4 𝐵 = (Base‘𝐺)
31, 2eqtr4di 2289 . . 3 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
4 fveq2 5695 . . . . . . 7 (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
5 isgrp.p . . . . . . 7 + = (+g‘𝐺)
64, 5eqtr4di 2289 . . . . . 6 (𝑔 = 𝐺 → (+g‘𝑔) = + )
76oveqd 6102 . . . . 5 (𝑔 = 𝐺 → (𝑚(+g‘𝑔)𝑎) = (𝑚 + 𝑎))
8 fveq2 5695 . . . . . 6 (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
9 isgrp.z . . . . . 6 0 = (0g‘𝐺)
108, 9eqtr4di 2289 . . . . 5 (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
117, 10eqeq12d 2253 . . . 4 (𝑔 = 𝐺 → ((𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ (𝑚 + 𝑎) = 0 ))
123, 11rexeqbidv 2766 . . 3 (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
133, 12raleqbidv 2765 . 2 (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
14 df-grp 13861 . 2 Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔)}
1513, 14elrab2 2985 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 ))
Colors of variables:    wff set class
This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +gcplusg 13484  0gc0g 13663  Mndcmnd 13782  Grpcgrp 13858
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-grp 13861
This theorem is used by:  grpmnd  13865  grpinvex  13868  grppropd  13875  isgrpd2e  13878  grp1  13964  ghmgrp  13974
  Copyright terms: Public domain W3C validator