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

Theorem isgrpd 19201
Description: Deduce a group from its properties. Unlike isgrpd2 19199, 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 7453 . . . . 5 (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥))
109eqeq1d 2765 . . . 4 (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 ))
1110rspcev 3580 . . 3 ((𝑁 ∈ 𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )
127, 8, 11syl2anc 596 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )
131, 2, 3, 4, 5, 6, 12isgrpde 19200 1 (𝜑 → 𝐺 ∈ Grp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  +gcplusg 17460  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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  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-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-riota 7403  df-ov 7449  df-0g 17644  df-mgm 18848  df-sgrp 18940  df-mnd 18956  df-grp 19179
This theorem is used by:  isgrpi  19202  issubg2  19384  symggrp  19647  isdrngd  21055  isdrngdOLD  21057  cnlmod  25494  dchrabl  27614  motgrp  29039  ldualgrplem  40405  tgrpgrplem  42009  erngdvlem1  42248  erngdvlem1-rN  42256  dvhgrp  42367  mendring  44393
  Copyright terms: Public domain W3C validator