![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > grpidlcan | Structured version Visualization version GIF version |
Description: If left adding an element of a group to an arbitrary element of the group results in this element, the added element is the identity element and vice versa. (Contributed by AV, 15-Mar-2019.) |
Ref | Expression |
---|---|
grpidrcan.b | ⊢ 𝐵 = (Base‘𝐺) |
grpidrcan.p | ⊢ + = (+g‘𝐺) |
grpidrcan.o | ⊢ 0 = (0g‘𝐺) |
Ref | Expression |
---|---|
grpidlcan | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = 𝑋 ↔ 𝑍 = 0 )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | grpidrcan.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
2 | grpidrcan.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
3 | grpidrcan.o | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
4 | 1, 2, 3 | grplid 18125 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋) |
5 | 4 | 3adant3 1129 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋) |
6 | 5 | eqeq2d 2809 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = ( 0 + 𝑋) ↔ (𝑍 + 𝑋) = 𝑋)) |
7 | simp1 1133 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝐺 ∈ Grp) | |
8 | simp3 1135 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝑍 ∈ 𝐵) | |
9 | 1, 3 | grpidcl 18123 | . . . 4 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
10 | 9 | 3ad2ant1 1130 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 0 ∈ 𝐵) |
11 | simp2 1134 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
12 | 1, 2 | grprcan 18129 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑍 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑍 + 𝑋) = ( 0 + 𝑋) ↔ 𝑍 = 0 )) |
13 | 7, 8, 10, 11, 12 | syl13anc 1369 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = ( 0 + 𝑋) ↔ 𝑍 = 0 )) |
14 | 6, 13 | bitr3d 284 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = 𝑋 ↔ 𝑍 = 0 )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 +gcplusg 16557 0gc0g 16705 Grpcgrp 18095 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-iota 6283 df-fun 6326 df-fv 6332 df-riota 7093 df-ov 7138 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 |
This theorem is referenced by: grpidssd 18167 |
Copyright terms: Public domain | W3C validator |