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

Theorem isgrpi 18874
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 1130 . . 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 18873 . 2 (⊤ → 𝐺 ∈ Grp)
1817mptru 1548 1 𝐺 ∈ Grp
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wtru 1542  wcel 2113  cfv 6486  (class class class)co 7352  Basecbs 17122  +gcplusg 17163  Grpcgrp 18848
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-iota 6442  df-fun 6488  df-fv 6494  df-riota 7309  df-ov 7355  df-0g 17347  df-mgm 18550  df-sgrp 18629  df-mnd 18645  df-grp 18851
This theorem is referenced by:  isgrpix  18879  cnaddabl  19783  cncrng  21327  cncrngOLD  21328  zsoring  28333
  Copyright terms: Public domain W3C validator