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

Theorem grpodivfval 30923
Description: Group division (or subtraction) operation. (Contributed by NM, 15-Feb-2008.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpdiv.1 𝑋 = ran 𝐺
grpdiv.2 𝑁 = (inv‘𝐺)
grpdiv.3 𝐷 = ( /𝑔𝐺)
Assertion
Ref Expression
grpodivfval (𝐺 ∈ GrpOp → 𝐷 = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))))
Distinct variable groups:   𝑥,𝑦,𝐺   𝑥,𝑁,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐷(𝑥, 𝑦)

Proof of Theorem grpodivfval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 grpdiv.3 . 2 𝐷 = ( /𝑔𝐺)
2 grpdiv.1 . . . . 5 𝑋 = ran 𝐺
3 rnexg 7908 . . . . 5 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
42, 3eqeltrid 2870 . . . 4 (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5 mpoexga 8083 . . . 4 ((𝑋 ∈ V ∧ 𝑋 ∈ V) → (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))) ∈ V)
64, 4, 5syl2anc 596 . . 3 (𝐺 ∈ GrpOp → (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))) ∈ V)
7 rneq 5931 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
87, 2eqtr4di 2819 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9 id 23 . . . . . 6 (𝑔 = 𝐺𝑔 = 𝐺)
10 eqidd 2767 . . . . . 6 (𝑔 = 𝐺𝑥 = 𝑥)
11 fveq2 6888 . . . . . . . 8 (𝑔 = 𝐺 → (inv‘𝑔) = (inv‘𝐺))
12 grpdiv.2 . . . . . . . 8 𝑁 = (inv‘𝐺)
1311, 12eqtr4di 2819 . . . . . . 7 (𝑔 = 𝐺 → (inv‘𝑔) = 𝑁)
1413fveq1d 6890 . . . . . 6 (𝑔 = 𝐺 → ((inv‘𝑔)‘𝑦) = (𝑁𝑦))
159, 10, 14oveq123d 7444 . . . . 5 (𝑔 = 𝐺 → (𝑥𝑔((inv‘𝑔)‘𝑦)) = (𝑥𝐺(𝑁𝑦)))
168, 8, 15mpoeq123dv 7498 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔, 𝑦 ∈ ran 𝑔 ↦ (𝑥𝑔((inv‘𝑔)‘𝑦))) = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))))
17 df-gdiv 30885 . . . 4 /𝑔 = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔, 𝑦 ∈ ran 𝑔 ↦ (𝑥𝑔((inv‘𝑔)‘𝑦))))
1816, 17fvmptg 6994 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))) ∈ V) → ( /𝑔𝐺) = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))))
196, 18mpdan 700 . 2 (𝐺 ∈ GrpOp → ( /𝑔𝐺) = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))))
201, 19eqtrid 2813 1 (𝐺 ∈ GrpOp → 𝐷 = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺(𝑁𝑦))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  Vcvv 3458  ran crn 5667  cfv 6543  (class class class)co 7423  cmpo 7425  GrpOpcgr 30878  invcgn 30880   /𝑔 cgs 30881
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-gdiv 30885
This theorem is used by:  grpodivval  30924  grpodivf  30927  nvmfval  31033
  Copyright terms: Public domain W3C validator