| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grplrinv | 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 2231 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 3 | 1, 2 | grpinvcl 13636 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((invg‘𝐺)‘𝑥) ∈ 𝐵) |
| 4 | oveq1 6025 | . . . . . 6 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → (𝑦 + 𝑥) = (((invg‘𝐺)‘𝑥) + 𝑥)) | |
| 5 | 4 | eqeq1d 2240 | . . . . 5 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → ((𝑦 + 𝑥) = 0 ↔ (((invg‘𝐺)‘𝑥) + 𝑥) = 0 )) |
| 6 | oveq2 6026 | . . . . . 6 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → (𝑥 + 𝑦) = (𝑥 + ((invg‘𝐺)‘𝑥))) | |
| 7 | 6 | eqeq1d 2240 | . . . . 5 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → ((𝑥 + 𝑦) = 0 ↔ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 )) |
| 8 | 5, 7 | anbi12d 473 | . . . 4 ⊢ (𝑦 = ((invg‘𝐺)‘𝑥) → (((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ) ↔ ((((invg‘𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 ))) |
| 9 | 8 | adantl 277 | . . 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 13638 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (((invg‘𝐺)‘𝑥) + 𝑥) = 0 ) |
| 13 | 1, 10, 11, 2 | grprinv 13639 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 ) |
| 14 | 12, 13 | jca 306 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((((invg‘𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg‘𝐺)‘𝑥)) = 0 )) |
| 15 | 3, 9, 14 | rspcedvd 2916 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 )) |
| 16 | 15 | ralrimiva 2605 | 1 ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 )) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ∀wral 2510 ∃wrex 2511 ‘cfv 5326 (class class class)co 6018 Basecbs 13087 +gcplusg 13165 0gc0g 13344 Grpcgrp 13588 invgcminusg 13589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-inn 9144 df-2 9202 df-ndx 13090 df-slot 13091 df-base 13093 df-plusg 13178 df-0g 13346 df-mgm 13444 df-sgrp 13490 df-mnd 13505 df-grp 13591 df-minusg 13592 |
| This theorem is referenced by: grpidinv2 13646 |
| Copyright terms: Public domain | W3C validator |