Theorem grpidlcan 13565

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.)

Hypotheses

Ref	Expression
grpidrcan.b	⊢ 𝐵 = (Base‘𝐺)
grpidrcan.p	⊢ + = (+g‘𝐺)
grpidrcan.o	⊢ 0 = (0g‘𝐺)

Assertion

Ref	Expression
grpidlcan	⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = 𝑋 ↔ 𝑍 = 0 ))

Proof of Theorem grpidlcan

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 13530	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋)
5	4	3adant3 1022	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋)
6	5	eqeq2d 2221	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = ( 0 + 𝑋) ↔ (𝑍 + 𝑋) = 𝑋))
7		simp1 1002	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝐺 ∈ Grp)
8		simp3 1004	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝑍 ∈ 𝐵)
9	1, 3	grpidcl 13528	. . . 4 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵)
10	9	3ad2ant1 1023	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 0 ∈ 𝐵)
11		simp2 1003	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝑋 ∈ 𝐵)
12	1, 2	grprcan 13536	. . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑍 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑍 + 𝑋) = ( 0 + 𝑋) ↔ 𝑍 = 0 ))
13	7, 8, 10, 11, 12	syl13anc 1254	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = ( 0 + 𝑋) ↔ 𝑍 = 0 ))
14	6, 13	bitr3d 190	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑋) = 𝑋 ↔ 𝑍 = 0 ))

Syntax hints:   → wi 4   ↔ wb 105   ∧ w3a 983   = wceq 1375   ∈ wcel 2180  ‘cfv 5294  (class class class)co 5974  Basecbs 12998  +_gcplusg 13076  0_gc0g 13255  Grpcgrp 13499

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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-sep 4181  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-cnex 8058  ax-resscn 8059  ax-1re 8061  ax-addrcl 8064

This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ral 2493  df-rex 2494  df-reu 2495  df-rmo 2496  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-un 3181  df-in 3183  df-ss 3190  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-iota 5254  df-fun 5296  df-fn 5297  df-fv 5302  df-riota 5927  df-ov 5977  df-inn 9079  df-2 9137  df-ndx 13001  df-slot 13002  df-base 13004  df-plusg 13089  df-0g 13257  df-mgm 13355  df-sgrp 13401  df-mnd 13416  df-grp 13502

This theorem is referenced by:  grpidssd  13575