| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grplrinv | Structured version Visualization version GIF version | ||
| Description: In a group, every member has a left and right inverse. (Contributed by AV, 1-Sep-2021.) |
| Ref | Expression |
|---|---|
| grplrinv.b | ⊢ 𝐵 = (Base‘𝐺) |
| grplrinv.p | ⊢ + = (+g‘𝐺) |
| grplrinv.i | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| grplrinv | ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grplrinv.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2763 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 3 | 1, 2 | grpinvcl 19248 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((invg‘𝐺)‘𝑥) ∈ 𝐵) |
| 4 | oveq1 7458 | . . . . . 6 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → (𝑦 + 𝑥) = (((invg‘𝐺)‘𝑥) + 𝑥)) | |
| 5 | 4 | eqeq1d 2765 | . . . . 5 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → ((𝑦 + 𝑥) = 0 ↔ (((invg‘𝐺)‘𝑥) + 𝑥) = 0 )) |
| 6 | oveq2 7459 | . . . . . 6 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → (𝑥 + 𝑦) = (𝑥 + ((invg‘𝐺)‘𝑥))) | |
| 7 | 6 | eqeq1d 2765 | . . . . 5 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → ((𝑥 + 𝑦) = 0 ↔ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 )) |
| 8 | 5, 7 | anbi12d 644 | . . . 4 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → (((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ) ↔ ((((invg‘𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 ))) |
| 9 | 8 | adantl 487 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 = ((invg‘𝐺)‘𝑥)) → (((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ) ↔ ((((invg‘𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 ))) |
| 10 | grplrinv.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 11 | grplrinv.i | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
| 12 | 1, 10, 11, 2 | grplinv 19250 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (((invg‘𝐺)‘𝑥) + 𝑥) = 0 ) |
| 13 | 1, 10, 11, 2 | grprinv 19251 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 ) |
| 14 | 12, 13 | jca 521 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((((invg‘𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 )) |
| 15 | 3, 9, 14 | rspcedvd 3582 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 )) |
| 16 | 15 | ralrimiva 3158 | 1 ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 0gc0g 17660 Grpcgrp 19194 invgcminusg 19195 |
| 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-pow 5334 ax-pr 5398 ax-un 7783 |
| 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-pw 4562 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-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fv 6574 df-riota 7408 df-ov 7454 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 |
| This theorem is used by: grpidinv2 19258 |
| Copyright terms: Public domain | W3C validator |