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

Theorem isgrpi 19176
Description: Properties that determine a group. 𝑁 (negative) is normally dependent on 𝑥 i.e. read it as 𝑁(𝑥). (Contributed by NM, 3-Sep-2011.)
Hypotheses
Ref Expression
isgrpi.b 𝐵 = (Base‘𝐺)
isgrpi.p + = (+g‘𝐺)
isgrpi.c ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
isgrpi.a ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
isgrpi.z 0 ∈ 𝐵
isgrpi.i (𝑥 ∈ 𝐵 → ( 0 + 𝑥) = 𝑥)
isgrpi.n (𝑥 ∈ 𝐵 → 𝑁 ∈ 𝐵)
isgrpi.j (𝑥 ∈ 𝐵 → (𝑁 + 𝑥) = 0 )
Assertion
Ref Expression
isgrpi 𝐺 ∈ Grp
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐺,𝑦,𝑧   𝑦,𝑁   𝑥, + ,𝑦,𝑧   𝑥, 0 ,𝑦,𝑧
Allowed substitution hints:   𝑁(𝑥, 𝑧)

Proof of Theorem isgrpi
StepHypRef Expression
1 isgrpi.b . . . 4 𝐵 = (Base‘𝐺)
21a1i 11 . . 3 (⊤ → 𝐵 = (Base‘𝐺))
3 isgrpi.p . . . 4 + = (+g‘𝐺)
43a1i 11 . . 3 (⊤ → + = (+g‘𝐺))
5 isgrpi.c . . . 4 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
653adant1 1148 . . 3 ((⊤ ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
7 isgrpi.a . . . 4 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
87adantl 487 . . 3 ((⊤ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
9 isgrpi.z . . . 4 0 ∈ 𝐵
109a1i 11 . . 3 (⊤ → 0 ∈ 𝐵)
11 isgrpi.i . . . 4 (𝑥 ∈ 𝐵 → ( 0 + 𝑥) = 𝑥)
1211adantl 487 . . 3 ((⊤ ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥)
13 isgrpi.n . . . 4 (𝑥 ∈ 𝐵 → 𝑁 ∈ 𝐵)
1413adantl 487 . . 3 ((⊤ ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵)
15 isgrpi.j . . . 4 (𝑥 ∈ 𝐵 → (𝑁 + 𝑥) = 0 )
1615adantl 487 . . 3 ((⊤ ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 )
172, 4, 6, 8, 10, 12, 14, 16isgrpd 19175 . 2 (⊤ → 𝐺 ∈ Grp)
1817mptru 1576 1 𝐺 ∈ Grp
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ⊤wtru 1570   ∈ wcel 2144  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  +gcplusg 17434  Grpcgrp 19150
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-riota 7378  df-ov 7424  df-0g 17618  df-mgm 18822  df-sgrp 18914  df-mnd 18930  df-grp 19153
This theorem is used by:  isgrpix  19181  cnaddabl  20089  cncrng  21705  zsoring  28801
  Copyright terms: Public domain W3C validator