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

Theorem isgrpd 13095
Description: Deduce a group from its properties. Unlike isgrpd2 13093, 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 5925 . . . . 5 (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥))
109eqeq1d 2202 . . . 4 (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 ))
1110rspcev 2864 . . 3 ((𝑁𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
127, 8, 11syl2anc 411 . 2 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
131, 2, 3, 4, 5, 6, 12isgrpde 13094 1 (𝜑𝐺 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2164  wrex 2473  cfv 5254  (class class class)co 5918  Basecbs 12618  +gcplusg 12695  Grpcgrp 13072
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-riota 5873  df-ov 5921  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075
This theorem is referenced by:  isgrpi  13096  grpressid  13133  issubg2m  13259
  Copyright terms: Public domain W3C validator