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

Theorem isgrpd 13820
Description: Deduce a group from its properties. Unlike isgrpd2 13818, 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 6065 . . . . 5 (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥))
109eqeq1d 2243 . . . 4 (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 ))
1110rspcev 2923 . . 3 ((𝑁𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
127, 8, 11syl2anc 411 . 2 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 0 )
131, 2, 3, 4, 5, 6, 12isgrpde 13819 1 (𝜑𝐺 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005   = wceq 1398  wcel 2205  wrex 2523  cfv 5357  (class class class)co 6058  Basecbs 13296  +gcplusg 13374  Grpcgrp 13797
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13653  df-sgrp 13699  df-mnd 13714  df-grp 13800
This theorem is referenced by:  isgrpi  13821  grpressid  13858  issubg2m  13990
  Copyright terms: Public domain W3C validator