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

Theorem grponpcan 31204
Description: Cancellation law for group division. (npcan 11604 analog.) (Contributed by NM, 15-Feb-2008.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpdivf.1 𝑋 = ran 𝐺
grpdivf.3 𝐷 = ( /𝑔 ‘𝐺)
Assertion
Ref Expression
grponpcan ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)

Proof of Theorem grponpcan
StepHypRef Expression
1 grpdivf.1 . . . 4 𝑋 = ran 𝐺
2 eqid 2766 . . . 4 (inv‘𝐺) = (inv‘𝐺)
3 grpdivf.3 . . . 4 𝐷 = ( /𝑔 ‘𝐺)
41, 2, 3grpodivval 31196 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵)))
54oveq1d 7465 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵))
6 simp1 1155 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐺 ∈ GrpOp)
7 simp2 1156 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋)
81, 2grpoinvcl 31185 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋)
983adant2 1150 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋)
10 simp3 1157 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋)
111grpoass 31164 . . . 4 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)))
126, 7, 9, 10, 11syl13anc 1402 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)))
13 eqid 2766 . . . . . . 7 (GId‘𝐺) = (GId‘𝐺)
141, 13, 2grpolinv 31187 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (((inv‘𝐺)‘𝐵)𝐺𝐵) = (GId‘𝐺))
1514oveq2d 7466 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺)))
16153adant2 1150 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺)))
171, 13grporid 31178 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴)
18173adant3 1151 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴)
1916, 18eqtrd 2801 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = 𝐴)
2012, 19eqtrd 2801 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = 𝐴)
215, 20eqtrd 2801 1 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ran crn 5658  ‘cfv 6565  (class class class)co 7450  GrpOpcgr 31150  GIdcgi 31151  invcgn 31152   /𝑔 cgs 31153
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-grpo 31154  df-gid 31155  df-ginv 31156  df-gdiv 31157
This theorem is used by:  grpoeqdivid  39083  ghomdiv  39094
  Copyright terms: Public domain W3C validator