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

Theorem grpodivfval 31166
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 7938 . . . . 5 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
42, 3eqeltrid 2868 . . . 4 (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5 mpoexga 8115 . . . 4 ((𝑋 ∈ V ∧ 𝑋 ∈ V) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))) ∈ V)
64, 4, 5syl2anc 596 . . 3 (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))) ∈ V)
7 rneq 5925 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
87, 2eqtr4di 2816 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9 id 23 . . . . . 6 (𝑔 = 𝐺 → 𝑔 = 𝐺)
10 eqidd 2764 . . . . . 6 (𝑔 = 𝐺 → 𝑥 = 𝑥)
11 fveq2 6908 . . . . . . . 8 (𝑔 = 𝐺 → (inv‘𝑔) = (inv‘𝐺))
12 grpdiv.2 . . . . . . . 8 𝑁 = (inv‘𝐺)
1311, 12eqtr4di 2816 . . . . . . 7 (𝑔 = 𝐺 → (inv‘𝑔) = 𝑁)
1413fveq1d 6910 . . . . . 6 (𝑔 = 𝐺 → ((inv‘𝑔)‘𝑦) = (𝑁‘𝑦))
159, 10, 14oveq123d 7464 . . . . 5 (𝑔 = 𝐺 → (𝑥𝑔((inv‘𝑔)‘𝑦)) = (𝑥𝐺(𝑁‘𝑦)))
168, 8, 15mpoeq123dv 7518 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔, 𝑦 ∈ ran 𝑔 ↦ (𝑥𝑔((inv‘𝑔)‘𝑦))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
17 df-gdiv 31128 . . . 4 /𝑔 = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔, 𝑦 ∈ ran 𝑔 ↦ (𝑥𝑔((inv‘𝑔)‘𝑦))))
1816, 17fvmptg 7014 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))) ∈ V) → ( /𝑔 ‘𝐺) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
196, 18mpdan 700 . 2 (𝐺 ∈ GrpOp → ( /𝑔 ‘𝐺) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
201, 19eqtrid 2810 1 (𝐺 ∈ GrpOp → 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺(𝑁‘𝑦))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ran crn 5656  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445  GrpOpcgr 31121  invcgn 31123   /𝑔 cgs 31124
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-gdiv 31128
This theorem is used by:  grpodivval  31167  grpodivf  31170  nvmfval  31276
  Copyright terms: Public domain W3C validator