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

Theorem isgrpd2 13597
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 2229, but we make an exception for theorems such as isgrpd2 13597 and ismndd 13513 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 6020 . . . . 5 (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥))
87eqeq1d 2238 . . . 4 (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 ))
98rspcev 2908 . . 3 ((𝑁𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
105, 6, 9syl2anc 411 . 2 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
111, 2, 3, 4, 10isgrpd2e 13596 1 (𝜑𝐺 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wrex 2509  cfv 5324  (class class class)co 6013  Basecbs 13075  +gcplusg 13153  0gc0g 13332  Mndcmnd 13492  Grpcgrp 13576
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-un 3202  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-iota 5284  df-fv 5332  df-ov 6016  df-grp 13579
This theorem is referenced by:  prdsgrpd  13685
  Copyright terms: Public domain W3C validator