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

Theorem grpodivf 31197
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 2763 . . . . . . . 8 (inv‘𝐺) = (inv‘𝐺)
31, 2grpoinvcl 31183 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
433adant2 1149 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
51grpocl 31159 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝑦) ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
64, 5syld3an3 1437 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
763expib 1140 . . . 4 (𝐺 ∈ GrpOp → ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋))
87ralrimivv 3207 . . 3 (𝐺 ∈ GrpOp → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
9 eqid 2763 . . . 4 (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))
109fmpo 8114 . . 3 (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋 ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
118, 10sylib 221 . 2 (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
12 grpdivf.3 . . . 4 𝐷 = ( /𝑔 ‘𝐺)
131, 2, 12grpodivfval 31193 . . 3 (𝐺 ∈ GrpOp → 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))))
1413feq1d 6721 . 2 (𝐺 ∈ GrpOp → (𝐷:(𝑋 × 𝑋)⟶𝑋 ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋))
1511, 14mpbird 260 1 (𝐺 ∈ GrpOp → 𝐷:(𝑋 × 𝑋)⟶𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080   × cxp 5656  ran crn 5659  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  GrpOpcgr 31148  invcgn 31150   /𝑔 cgs 31151
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-grpo 31152  df-gid 31153  df-ginv 31154  df-gdiv 31155
This theorem is used by:  grpodivcl  31198
  Copyright terms: Public domain W3C validator