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

Theorem isgrpd2 19217
Description: Deduce a group from its properties. 𝑁 (negative) is normally dependent on 𝑥 i.e. read it as 𝑁(𝑥). Note: normally we don't use a 𝜑 antecedent on hypotheses that name structure components, since they can be eliminated with eqid 2763, but we make an exception for theorems such as isgrpd2 19217, ismndd 18996, and islmodd 21192 since theorems using them often rewrite the structure components. (Contributed by NM, 10-Aug-2013.)
Hypotheses
Ref Expression
isgrpd2.b (𝜑 → 𝐵 = (Base‘𝐺))
isgrpd2.p (𝜑 → + = (+g‘𝐺))
isgrpd2.z (𝜑 → 0 = (0g‘𝐺))
isgrpd2.g (𝜑 → 𝐺 ∈ Mnd)
isgrpd2.n ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵)
isgrpd2.j ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 )
Assertion
Ref Expression
isgrpd2 (𝜑 → 𝐺 ∈ Grp)
Distinct variable groups:   𝑥, +   𝑥,𝐵   𝑥,𝐺   𝜑,𝑥
Allowed substitution hints:   𝑁(𝑥)   0 (𝑥)

Proof of Theorem isgrpd2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 isgrpd2.b . 2 (𝜑 → 𝐵 = (Base‘𝐺))
2 isgrpd2.p . 2 (𝜑 → + = (+g‘𝐺))
3 isgrpd2.z . 2 (𝜑 → 0 = (0g‘𝐺))
4 isgrpd2.g . 2 (𝜑 → 𝐺 ∈ Mnd)
5 isgrpd2.n . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵)
6 isgrpd2.j . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 )
7 oveq1 7458 . . . . 5 (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥))
87eqeq1d 2765 . . . 4 (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 ))
98rspcev 3580 . . 3 ((𝑁 ∈ 𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )
105, 6, 9syl2anc 596 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )
111, 2, 3, 4, 10isgrpd2e 19216 1 (𝜑 → 𝐺 ∈ Grp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Mndcmnd 18973  Grpcgrp 19194
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-ext 2735
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454  df-grp 19197
This theorem is used by:  prdsgrpd  19310  oppggrp  19622
  Copyright terms: Public domain W3C validator