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

Theorem grporcan 30607
Description: Right cancellation law for groups. (Contributed by NM, 26-Oct-2006.) (New usage is discouraged.)
Hypothesis
Ref Expression
grprcan.1 𝑋 = ran 𝐺
Assertion
Ref Expression
grporcan ((𝐺 ∈ GrpOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) ↔ 𝐴 = 𝐵))

Proof of Theorem grporcan
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 grprcan.1 . . . . . . . 8 𝑋 = ran 𝐺
2 eqid 2737 . . . . . . . 8 (GId‘𝐺) = (GId‘𝐺)
31, 2grpoidinv2 30604 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐶𝑋) → ((((GId‘𝐺)𝐺𝐶) = 𝐶 ∧ (𝐶𝐺(GId‘𝐺)) = 𝐶) ∧ ∃𝑦𝑋 ((𝑦𝐺𝐶) = (GId‘𝐺) ∧ (𝐶𝐺𝑦) = (GId‘𝐺))))
4 simpr 484 . . . . . . . . 9 (((𝑦𝐺𝐶) = (GId‘𝐺) ∧ (𝐶𝐺𝑦) = (GId‘𝐺)) → (𝐶𝐺𝑦) = (GId‘𝐺))
54reximi 3076 . . . . . . . 8 (∃𝑦𝑋 ((𝑦𝐺𝐶) = (GId‘𝐺) ∧ (𝐶𝐺𝑦) = (GId‘𝐺)) → ∃𝑦𝑋 (𝐶𝐺𝑦) = (GId‘𝐺))
65adantl 481 . . . . . . 7 (((((GId‘𝐺)𝐺𝐶) = 𝐶 ∧ (𝐶𝐺(GId‘𝐺)) = 𝐶) ∧ ∃𝑦𝑋 ((𝑦𝐺𝐶) = (GId‘𝐺) ∧ (𝐶𝐺𝑦) = (GId‘𝐺))) → ∃𝑦𝑋 (𝐶𝐺𝑦) = (GId‘𝐺))
73, 6syl 17 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐶𝑋) → ∃𝑦𝑋 (𝐶𝐺𝑦) = (GId‘𝐺))
87ad2ant2rl 750 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) → ∃𝑦𝑋 (𝐶𝐺𝑦) = (GId‘𝐺))
9 oveq1 7368 . . . . . . . . . . . 12 ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) → ((𝐴𝐺𝐶)𝐺𝑦) = ((𝐵𝐺𝐶)𝐺𝑦))
109ad2antll 730 . . . . . . . . . . 11 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶))) → ((𝐴𝐺𝐶)𝐺𝑦) = ((𝐵𝐺𝐶)𝐺𝑦))
111grpoass 30592 . . . . . . . . . . . . . 14 ((𝐺 ∈ GrpOp ∧ (𝐴𝑋𝐶𝑋𝑦𝑋)) → ((𝐴𝐺𝐶)𝐺𝑦) = (𝐴𝐺(𝐶𝐺𝑦)))
12113anassrs 1362 . . . . . . . . . . . . 13 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ 𝐶𝑋) ∧ 𝑦𝑋) → ((𝐴𝐺𝐶)𝐺𝑦) = (𝐴𝐺(𝐶𝐺𝑦)))
1312adantlrl 721 . . . . . . . . . . . 12 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ 𝑦𝑋) → ((𝐴𝐺𝐶)𝐺𝑦) = (𝐴𝐺(𝐶𝐺𝑦)))
1413adantrr 718 . . . . . . . . . . 11 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶))) → ((𝐴𝐺𝐶)𝐺𝑦) = (𝐴𝐺(𝐶𝐺𝑦)))
151grpoass 30592 . . . . . . . . . . . . . . 15 ((𝐺 ∈ GrpOp ∧ (𝐵𝑋𝐶𝑋𝑦𝑋)) → ((𝐵𝐺𝐶)𝐺𝑦) = (𝐵𝐺(𝐶𝐺𝑦)))
16153exp2 1356 . . . . . . . . . . . . . 14 (𝐺 ∈ GrpOp → (𝐵𝑋 → (𝐶𝑋 → (𝑦𝑋 → ((𝐵𝐺𝐶)𝐺𝑦) = (𝐵𝐺(𝐶𝐺𝑦))))))
1716imp42 426 . . . . . . . . . . . . 13 (((𝐺 ∈ GrpOp ∧ (𝐵𝑋𝐶𝑋)) ∧ 𝑦𝑋) → ((𝐵𝐺𝐶)𝐺𝑦) = (𝐵𝐺(𝐶𝐺𝑦)))
1817adantllr 720 . . . . . . . . . . . 12 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ 𝑦𝑋) → ((𝐵𝐺𝐶)𝐺𝑦) = (𝐵𝐺(𝐶𝐺𝑦)))
1918adantrr 718 . . . . . . . . . . 11 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶))) → ((𝐵𝐺𝐶)𝐺𝑦) = (𝐵𝐺(𝐶𝐺𝑦)))
2010, 14, 193eqtr3d 2780 . . . . . . . . . 10 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶))) → (𝐴𝐺(𝐶𝐺𝑦)) = (𝐵𝐺(𝐶𝐺𝑦)))
2120adantrrl 725 . . . . . . . . 9 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → (𝐴𝐺(𝐶𝐺𝑦)) = (𝐵𝐺(𝐶𝐺𝑦)))
22 oveq2 7369 . . . . . . . . . . 11 ((𝐶𝐺𝑦) = (GId‘𝐺) → (𝐴𝐺(𝐶𝐺𝑦)) = (𝐴𝐺(GId‘𝐺)))
2322ad2antrl 729 . . . . . . . . . 10 ((𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶))) → (𝐴𝐺(𝐶𝐺𝑦)) = (𝐴𝐺(GId‘𝐺)))
2423adantl 481 . . . . . . . . 9 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → (𝐴𝐺(𝐶𝐺𝑦)) = (𝐴𝐺(GId‘𝐺)))
25 oveq2 7369 . . . . . . . . . . 11 ((𝐶𝐺𝑦) = (GId‘𝐺) → (𝐵𝐺(𝐶𝐺𝑦)) = (𝐵𝐺(GId‘𝐺)))
2625ad2antrl 729 . . . . . . . . . 10 ((𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶))) → (𝐵𝐺(𝐶𝐺𝑦)) = (𝐵𝐺(GId‘𝐺)))
2726adantl 481 . . . . . . . . 9 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → (𝐵𝐺(𝐶𝐺𝑦)) = (𝐵𝐺(GId‘𝐺)))
2821, 24, 273eqtr3d 2780 . . . . . . . 8 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → (𝐴𝐺(GId‘𝐺)) = (𝐵𝐺(GId‘𝐺)))
291, 2grporid 30606 . . . . . . . . 9 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴)
3029ad2antrr 727 . . . . . . . 8 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → (𝐴𝐺(GId‘𝐺)) = 𝐴)
311, 2grporid 30606 . . . . . . . . . 10 ((𝐺 ∈ GrpOp ∧ 𝐵𝑋) → (𝐵𝐺(GId‘𝐺)) = 𝐵)
3231ad2ant2r 748 . . . . . . . . 9 (((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) → (𝐵𝐺(GId‘𝐺)) = 𝐵)
3332adantr 480 . . . . . . . 8 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → (𝐵𝐺(GId‘𝐺)) = 𝐵)
3428, 30, 333eqtr3d 2780 . . . . . . 7 ((((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) ∧ (𝑦𝑋 ∧ ((𝐶𝐺𝑦) = (GId‘𝐺) ∧ (𝐴𝐺𝐶) = (𝐵𝐺𝐶)))) → 𝐴 = 𝐵)
3534exp45 438 . . . . . 6 (((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) → (𝑦𝑋 → ((𝐶𝐺𝑦) = (GId‘𝐺) → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) → 𝐴 = 𝐵))))
3635rexlimdv 3137 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) → (∃𝑦𝑋 (𝐶𝐺𝑦) = (GId‘𝐺) → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) → 𝐴 = 𝐵)))
378, 36mpd 15 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) → 𝐴 = 𝐵))
38 oveq1 7368 . . . 4 (𝐴 = 𝐵 → (𝐴𝐺𝐶) = (𝐵𝐺𝐶))
3937, 38impbid1 225 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐴𝑋) ∧ (𝐵𝑋𝐶𝑋)) → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) ↔ 𝐴 = 𝐵))
4039exp43 436 . 2 (𝐺 ∈ GrpOp → (𝐴𝑋 → (𝐵𝑋 → (𝐶𝑋 → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) ↔ 𝐴 = 𝐵)))))
41403imp2 1351 1 ((𝐺 ∈ GrpOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐺𝐶) = (𝐵𝐺𝐶) ↔ 𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wrex 3062  ran crn 5626  cfv 6493  (class class class)co 7361  GrpOpcgr 30578  GIdcgi 30579
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5371  ax-un 7683
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fo 6499  df-fv 6501  df-riota 7318  df-ov 7364  df-grpo 30582  df-gid 30583
This theorem is referenced by:  grpoinveu  30608  grpoid  30609  nvrcan  30713  ghomdiv  38230  rngorcan  38255  rngorz  38261
  Copyright terms: Public domain W3C validator