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

Theorem grpodivf 30827
Description: Mapping for group division. (Contributed by NM, 10-Apr-2008.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpdivf.1 𝑋 = ran 𝐺
grpdivf.3 𝐷 = ( /𝑔𝐺)
Assertion
Ref Expression
grpodivf (𝐺 ∈ GrpOp → 𝐷:(𝑋 × 𝑋)⟶𝑋)

Proof of Theorem grpodivf
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpdivf.1 . . . . . . . 8 𝑋 = ran 𝐺
2 eqid 2769 . . . . . . . 8 (inv‘𝐺) = (inv‘𝐺)
31, 2grpoinvcl 30813 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
433adant2 1147 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋𝑦𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
51grpocl 30789 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋 ∧ ((inv‘𝐺)‘𝑦) ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
64, 5syld3an3 1434 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋𝑦𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
763expib 1138 . . . 4 (𝐺 ∈ GrpOp → ((𝑥𝑋𝑦𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋))
87ralrimivv 3212 . . 3 (𝐺 ∈ GrpOp → ∀𝑥𝑋𝑦𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
9 eqid 2769 . . . 4 (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))) = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))
109fmpo 8061 . . 3 (∀𝑥𝑋𝑦𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋 ↔ (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
118, 10sylib 221 . 2 (𝐺 ∈ GrpOp → (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
12 grpdivf.3 . . . 4 𝐷 = ( /𝑔𝐺)
131, 2, 12grpodivfval 30823 . . 3 (𝐺 ∈ GrpOp → 𝐷 = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))))
1413feq1d 6685 . 2 (𝐺 ∈ GrpOp → (𝐷:(𝑋 × 𝑋)⟶𝑋 ↔ (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋))
1511, 14mpbird 260 1 (𝐺 ∈ GrpOp → 𝐷:(𝑋 × 𝑋)⟶𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  wral 3085   × cxp 5657  ran crn 5660  wf 6530  cfv 6534  (class class class)co 7408  cmpo 7410  GrpOpcgr 30778  invcgn 30780   /𝑔 cgs 30781
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7982  df-2nd 7983  df-grpo 30782  df-gid 30783  df-ginv 30784  df-gdiv 30785
This theorem is referenced by:  grpodivcl  30828
  Copyright terms: Public domain W3C validator