| 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 2734, but we make an exception for theorems such as isgrpd2 18944, ismndd 18739, and islmodd 20833 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 7420 | . . . . 5 ⊢ (𝑦 = 𝑁 → (𝑦 + 𝑥) = (𝑁 + 𝑥)) | |
| 8 | 7 | eqeq1d 2736 | . . . 4 ⊢ (𝑦 = 𝑁 → ((𝑦 + 𝑥) = 0 ↔ (𝑁 + 𝑥) = 0 )) |
| 9 | 8 | rspcev 3605 | . . 3 ⊢ ((𝑁 ∈ 𝐵 ∧ (𝑁 + 𝑥) = 0 ) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 10 | 5, 6, 9 | syl2anc 584 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 11 | 1, 2, 3, 4, 10 | isgrpd2e 18943 | 1 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ∃wrex 3059 ‘cfv 6541 (class class class)co 7413 Basecbs 17230 +gcplusg 17274 0gc0g 17456 Mndcmnd 18717 Grpcgrp 18921 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-ral 3051 df-rex 3060 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-iota 6494 df-fv 6549 df-ov 7416 df-grp 18924 |
| This theorem is referenced by: prdsgrpd 19038 oppggrp 19345 |
| Copyright terms: Public domain | W3C validator |