Theorem isgrpi 19027

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

Step	Hyp	Ref	Expression
1		isgrpi.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
2	1	a1i 11	. . 3 ⊢ (⊤ → 𝐵 = (Base‘𝐺))
3		isgrpi.p	. . . 4 ⊢ + = (+g‘𝐺)
4	3	a1i 11	. . 3 ⊢ (⊤ → + = (+g‘𝐺))
5		isgrpi.c	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
6	5	3adant1 1148	. . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
7		isgrpi.a	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
8	7	adantl 486	. . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
9		isgrpi.z	. . . 4 ⊢ 0 ∈ 𝐵
10	9	a1i 11	. . 3 ⊢ (⊤ → 0 ∈ 𝐵)
11		isgrpi.i	. . . 4 ⊢ (𝑥 ∈ 𝐵 → ( 0 + 𝑥) = 𝑥)
12	11	adantl 486	. . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥)
13		isgrpi.n	. . . 4 ⊢ (𝑥 ∈ 𝐵 → 𝑁 ∈ 𝐵)
14	13	adantl 486	. . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵)
15		isgrpi.j	. . . 4 ⊢ (𝑥 ∈ 𝐵 → (𝑁 + 𝑥) = 0 )
16	15	adantl 486	. . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 )
17	2, 4, 6, 8, 10, 12, 14, 16	isgrpd 19026	. 2 ⊢ (⊤ → 𝐺 ∈ Grp)
18	17	mptru 1577	1 ⊢ 𝐺 ∈ Grp

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570  ⊤wtru 1571   ∈ wcel 2143  ‘cfv 6538  (class class class)co 7412  Basecbs 17270  +_gcplusg 17311  Grpcgrp 19001

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-riota 7369  df-ov 7415  df-0g 17495  df-mgm 18699  df-sgrp 18778  df-mnd 18794  df-grp 19004

This theorem is referenced by:  isgrpix  19032  cnaddabl  19940  cncrng  21524  zsoring  28583