MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpidrcan Structured version   Visualization version   GIF version

Theorem grpidrcan 19194
Description: If right 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
grpidrcan ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 + 𝑍) = 𝑋 ↔ 𝑍 = 0 ))

Proof of Theorem grpidrcan
StepHypRef Expression
1 grpidrcan.b . . . . 5 𝐵 = (Base‘𝐺)
2 grpidrcan.p . . . . 5 + = (+g‘𝐺)
3 grpidrcan.o . . . . 5 0 = (0g‘𝐺)
41, 2, 3grprid 19159 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + 0 ) = 𝑋)
543adant3 1150 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 + 0 ) = 𝑋)
65eqeq2d 2772 . 2 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 + 𝑍) = (𝑋 + 0 ) ↔ (𝑋 + 𝑍) = 𝑋))
7 simp1 1154 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝐺 ∈ Grp)
8 simp3 1156 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝑍 ∈ 𝐵)
91, 3grpidcl 19156 . . . 4 (𝐺 ∈ Grp → 0 ∈ 𝐵)
1093ad2ant1 1151 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 0 ∈ 𝐵)
11 simp2 1155 . . 3 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → 𝑋 ∈ 𝐵)
121, 2grplcan 19191 . . 3 ((𝐺 ∈ Grp ∧ (𝑍 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑋 + 𝑍) = (𝑋 + 0 ) ↔ 𝑍 = 0 ))
137, 8, 10, 11, 12syl13anc 1399 . 2 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 + 𝑍) = (𝑋 + 0 ) ↔ 𝑍 = 0 ))
146, 13bitr3d 284 1 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 + 𝑍) = 𝑋 ↔ 𝑍 = 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  +gcplusg 17408  0gc0g 17590  Grpcgrp 19124
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-riota 7369  df-ov 7415  df-0g 17592  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-grp 19127  df-minusg 19128
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator