Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isgrpd2 | Structured version Visualization version GIF version |
Description: Deduce a group from its properties. 𝑁 (negative) is normally dependent on 𝑥 i.e. read it as 𝑁(𝑥). Note: normally we don't use a 𝜑 antecedent on hypotheses that name structure components, since they can be eliminated with eqid 2738, but we make an exception for theorems such as isgrpd2 18514, ismndd 18322, and islmodd 20044 since theorems using them often rewrite the structure components. (Contributed by NM, 10-Aug-2013.) |
Ref | Expression |
---|---|
isgrpd2.b | ⊢ (𝜑 → 𝐵 = (Base‘𝐺)) |
isgrpd2.p | ⊢ (𝜑 → + = (+g‘𝐺)) |
isgrpd2.z | ⊢ (𝜑 → 0 = (0g‘𝐺)) |
isgrpd2.g | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
isgrpd2.n | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵) |
isgrpd2.j | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 ) |
Ref | Expression |
---|---|
isgrpd2 | ⊢ (𝜑 → 𝐺 ∈ Grp) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isgrpd2.b | . 2 ⊢ (𝜑 → 𝐵 = (Base‘𝐺)) | |
2 | isgrpd2.p | . 2 ⊢ (𝜑 → + = (+g‘𝐺)) | |
3 | isgrpd2.z | . 2 ⊢ (𝜑 → 0 = (0g‘𝐺)) | |
4 | isgrpd2.g | . 2 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
5 | isgrpd2.n | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑁 ∈ 𝐵) | |
6 | isgrpd2.j | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑁 + 𝑥) = 0 ) | |
7 | oveq1 7262 | . . . . 5 ⊢ (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥)) | |
8 | 7 | eqeq1d 2740 | . . . 4 ⊢ (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 )) |
9 | 8 | rspcev 3552 | . . 3 ⊢ ((𝑁 ∈ 𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
10 | 5, 6, 9 | syl2anc 583 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
11 | 1, 2, 3, 4, 10 | isgrpd2e 18513 | 1 ⊢ (𝜑 → 𝐺 ∈ Grp) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∃wrex 3064 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 +gcplusg 16888 0gc0g 17067 Mndcmnd 18300 Grpcgrp 18492 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-iota 6376 df-fv 6426 df-ov 7258 df-grp 18495 |
This theorem is referenced by: prdsgrpd 18600 oppggrp 18879 |
Copyright terms: Public domain | W3C validator |