| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isgrpi | Structured version Visualization version GIF version | ||
| Description: Properties that determine a group. 𝑁 (negative) is normally dependent on 𝑥 i.e. read it as 𝑁(𝑥). (Contributed by NM, 3-Sep-2011.) |
| Ref | Expression |
|---|---|
| isgrpi.b | ⊢ 𝐵 = (Base‘𝐺) |
| isgrpi.p | ⊢ + = (+g‘𝐺) |
| isgrpi.c | ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
| isgrpi.a | ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| isgrpi.z | ⊢ 0 ∈ 𝐵 |
| isgrpi.i | ⊢ (𝑥 ∈ 𝐵 → ( 0 + 𝑥) = 𝑥) |
| isgrpi.n | ⊢ (𝑥 ∈ 𝐵 → 𝑁 ∈ 𝐵) |
| isgrpi.j | ⊢ (𝑥 ∈ 𝐵 → (𝑁 + 𝑥) = 0 ) |
| Ref | Expression |
|---|---|
| isgrpi | ⊢ 𝐺 ∈ Grp |
| 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 1146 | . . 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 19013 | . 2 ⊢ (⊤ → 𝐺 ∈ Grp) |
| 18 | 17 | mptru 1570 | 1 ⊢ 𝐺 ∈ Grp |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ⊤wtru 1564 ∈ wcel 2145 ‘cfv 6525 (class class class)co 7400 Basecbs 17257 +gcplusg 17298 Grpcgrp 18988 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6481 df-fun 6527 df-fv 6533 df-riota 7357 df-ov 7403 df-0g 17482 df-mgm 18686 df-sgrp 18765 df-mnd 18781 df-grp 18991 |
| This theorem is referenced by: isgrpix 19019 cnaddabl 19927 cncrng 21500 zsoring 28556 |
| Copyright terms: Public domain | W3C validator |