| 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 1148 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
| 7 | isgrpi.a | . . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 8 | 7 | adantl 487 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 9 | isgrpi.z | . . . 4 ⊢ 0 ∈ 𝐵 | |
| 10 | 9 | a1i 11 | . . 3 ⊢ (⊤ → 0 ∈ 𝐵) |
| 11 | isgrpi.i | . . . 4 ⊢ (𝑥 ∈ 𝐵 → ( 0 + 𝑥) = 𝑥) | |
| 12 | 11 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥) |
| 13 | isgrpi.n | . . . 4 ⊢ (𝑥 ∈ 𝐵 → 𝑁 ∈ 𝐵) | |
| 14 | 13 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵) |
| 15 | isgrpi.j | . . . 4 ⊢ (𝑥 ∈ 𝐵 → (𝑁 + 𝑥) = 0 ) | |
| 16 | 15 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 ) |
| 17 | 2, 4, 6, 8, 10, 12, 14, 16 | isgrpd 19219 | . 2 ⊢ (⊤ → 𝐺 ∈ Grp) |
| 18 | 17 | mptru 1577 | 1 ⊢ 𝐺 ∈ Grp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ⊤wtru 1571 ∈ wcel 2147 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 Grpcgrp 19194 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-riota 7408 df-ov 7454 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 |
| This theorem is used by: isgrpix 19225 cnaddabl 20134 cncrng 21751 zsoring 28852 |
| Copyright terms: Public domain | W3C validator |