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

Theorem isgrpi 18901
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 1131 . . 3 ((⊤ ∧ 𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
7 isgrpi.a . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
87adantl 481 . . 3 ((⊤ ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
9 isgrpi.z . . . 4 0𝐵
109a1i 11 . . 3 (⊤ → 0𝐵)
11 isgrpi.i . . . 4 (𝑥𝐵 → ( 0 + 𝑥) = 𝑥)
1211adantl 481 . . 3 ((⊤ ∧ 𝑥𝐵) → ( 0 + 𝑥) = 𝑥)
13 isgrpi.n . . . 4 (𝑥𝐵𝑁𝐵)
1413adantl 481 . . 3 ((⊤ ∧ 𝑥𝐵) → 𝑁𝐵)
15 isgrpi.j . . . 4 (𝑥𝐵 → (𝑁 + 𝑥) = 0 )
1615adantl 481 . . 3 ((⊤ ∧ 𝑥𝐵) → (𝑁 + 𝑥) = 0 )
172, 4, 6, 8, 10, 12, 14, 16isgrpd 18900 . 2 (⊤ → 𝐺 ∈ Grp)
1817mptru 1549 1 𝐺 ∈ Grp
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wtru 1543  wcel 2114  cfv 6500  (class class class)co 7368  Basecbs 17148  +gcplusg 17189  Grpcgrp 18875
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-riota 7325  df-ov 7371  df-0g 17373  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-grp 18878
This theorem is referenced by:  isgrpix  18906  cnaddabl  19810  cncrng  21355  cncrngOLD  21356  zsoring  28417
  Copyright terms: Public domain W3C validator