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

Theorem grpodivfval 31118
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 7903 . . . . 5 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
42, 3eqeltrid 2865 . . . 4 (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5 mpoexga 8079 . . . 4 ((𝑋 ∈ V ∧ 𝑋 ∈ V) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))) ∈ V)
64, 4, 5syl2anc 596 . . 3 (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))) ∈ V)
7 rneq 5918 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
87, 2eqtr4di 2814 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9 id 23 . . . . . 6 (𝑔 = 𝐺 → 𝑔 = 𝐺)
10 eqidd 2762 . . . . . 6 (𝑔 = 𝐺 → 𝑥 = 𝑥)
11 fveq2 6877 . . . . . . . 8 (𝑔 = 𝐺 → (inv‘𝑔) = (inv‘𝐺))
12 grpdiv.2 . . . . . . . 8 𝑁 = (inv‘𝐺)
1311, 12eqtr4di 2814 . . . . . . 7 (𝑔 = 𝐺 → (inv‘𝑔) = 𝑁)
1413fveq1d 6879 . . . . . 6 (𝑔 = 𝐺 → ((inv‘𝑔)‘𝑦) = (𝑁‘𝑦))
159, 10, 14oveq123d 7433 . . . . 5 (𝑔 = 𝐺 → (𝑥𝑔((inv‘𝑔)‘𝑦)) = (𝑥𝐺(𝑁‘𝑦)))
168, 8, 15mpoeq123dv 7487 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔, 𝑦 ∈ ran 𝑔 ↦ (𝑥𝑔((inv‘𝑔)‘𝑦))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
17 df-gdiv 31080 . . . 4 /𝑔 = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔, 𝑦 ∈ ran 𝑔 ↦ (𝑥𝑔((inv‘𝑔)‘𝑦))))
1816, 17fvmptg 6983 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))) ∈ V) → ( /𝑔 ‘𝐺) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
196, 18mpdan 700 . 2 (𝐺 ∈ GrpOp → ( /𝑔 ‘𝐺) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
201, 19eqtrid 2808 1 (𝐺 ∈ GrpOp → 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ran crn 5652  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  GrpOpcgr 31073  invcgn 31075   /𝑔 cgs 31076
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-rep 5232  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-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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-iun 4953  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-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-gdiv 31080
This theorem is used by:  grpodivval  31119  grpodivf  31122  nvmfval  31228
  Copyright terms: Public domain W3C validator