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

Theorem isgrpd 19026
Description: Deduce a group from its properties. Unlike isgrpd2 19024, this one goes straight from the base properties rather than going through Mnd. 𝑁 (negative) is normally dependent on 𝑥 i.e. read it as 𝑁(𝑥). (Contributed by NM, 6-Jun-2013.) (Revised by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
isgrpd.b (𝜑𝐵 = (Base‘𝐺))
isgrpd.p (𝜑+ = (+g𝐺))
isgrpd.c ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
isgrpd.a ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
isgrpd.z (𝜑0𝐵)
isgrpd.i ((𝜑𝑥𝐵) → ( 0 + 𝑥) = 𝑥)
isgrpd.n ((𝜑𝑥𝐵) → 𝑁𝐵)
isgrpd.j ((𝜑𝑥𝐵) → (𝑁 + 𝑥) = 0 )
Assertion
Ref Expression
isgrpd (𝜑𝐺 ∈ Grp)
Distinct variable groups:   𝑥,𝑦,𝑧, +   𝑥, 0 ,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑦,𝑁   𝜑,𝑥,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧
Allowed substitution hints:   𝑁(𝑥,𝑧)

Proof of Theorem isgrpd
StepHypRef Expression
1 isgrpd.b . 2 (𝜑𝐵 = (Base‘𝐺))
2 isgrpd.p . 2 (𝜑+ = (+g𝐺))
3 isgrpd.c . 2 ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
4 isgrpd.a . 2 ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
5 isgrpd.z . 2 (𝜑0𝐵)
6 isgrpd.i . 2 ((𝜑𝑥𝐵) → ( 0 + 𝑥) = 𝑥)
7 isgrpd.n . . 3 ((𝜑𝑥𝐵) → 𝑁𝐵)
8 isgrpd.j . . 3 ((𝜑𝑥𝐵) → (𝑁 + 𝑥) = 0 )
9 oveq1 7419 . . . . 5 (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥))
109eqeq1d 2765 . . . 4 (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 ))
1110rspcev 3582 . . 3 ((𝑁𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
127, 8, 11syl2anc 595 . 2 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
131, 2, 3, 4, 5, 6, 12isgrpde 19025 1 (𝜑𝐺 ∈ Grp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  wrex 3089  cfv 6538  (class class class)co 7412  Basecbs 17270  +gcplusg 17311  Grpcgrp 19001
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-riota 7369  df-ov 7415  df-0g 17495  df-mgm 18699  df-sgrp 18778  df-mnd 18794  df-grp 19004
This theorem is referenced by:  isgrpi  19027  issubg2  19209  symggrp  19471  isdrngd  20850  isdrngdOLD  20852  cnlmod  25280  dchrabl  27399  motgrp  28793  ldualgrplem  39900  tgrpgrplem  41504  erngdvlem1  41743  erngdvlem1-rN  41751  dvhgrp  41862  mendring  43898
  Copyright terms: Public domain W3C validator