| 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 2740, but we make an exception for theorems such as isgrpd2 18930, ismndd 18722, and islmodd 20863 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 7370 | . . . . 5 ⊢ (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥)) | |
| 8 | 7 | eqeq1d 2742 | . . . 4 ⊢ (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 )) |
| 9 | 8 | rspcev 3567 | . . 3 ⊢ ((𝑁 ∈ 𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 10 | 5, 6, 9 | syl2anc 590 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 11 | 1, 2, 3, 4, 10 | isgrpd2e 18929 | 1 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃wrex 3064 ‘cfv 6492 (class class class)co 7363 Basecbs 17177 +gcplusg 17218 0gc0g 17400 Mndcmnd 18700 Grpcgrp 18907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-iota 6448 df-fv 6500 df-ov 7366 df-grp 18910 |
| This theorem is referenced by: prdsgrpd 19024 oppggrp 19330 |
| Copyright terms: Public domain | W3C validator |