| 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 2760, but we make an exception for theorems such as isgrpd2 19174, ismndd 18953, and islmodd 21148 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 7429 | . . . . 5 ⊢ (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥)) | |
| 8 | 7 | eqeq1d 2762 | . . . 4 ⊢ (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 )) |
| 9 | 8 | rspcev 3576 | . . 3 ⊢ ((𝑁 ∈ 𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 10 | 5, 6, 9 | syl2anc 596 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 11 | 1, 2, 3, 4, 10 | isgrpd2e 19173 | 1 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 ‘cfv 6541 (class class class)co 7422 Basecbs 17394 +gcplusg 17435 0gc0g 17617 Mndcmnd 18930 Grpcgrp 19151 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-iota 6496 df-fv 6549 df-ov 7425 df-grp 19154 |
| This theorem is used by: prdsgrpd 19267 oppggrp 19578 |
| Copyright terms: Public domain | W3C validator |