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

Theorem grpodivf 31019
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 2760 . . . . . . . 8 (inv‘𝐺) = (inv‘𝐺)
31, 2grpoinvcl 31005 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
433adant2 1149 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋𝑦𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
51grpocl 30981 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋 ∧ ((inv‘𝐺)‘𝑦) ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
64, 5syld3an3 1436 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋𝑦𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
763expib 1140 . . . 4 (𝐺 ∈ GrpOp → ((𝑥𝑋𝑦𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋))
87ralrimivv 3203 . . 3 (𝐺 ∈ GrpOp → ∀𝑥𝑋𝑦𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
9 eqid 2760 . . . 4 (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))) = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))
109fmpo 8065 . . 3 (∀𝑥𝑋𝑦𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋 ↔ (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
118, 10sylib 221 . 2 (𝐺 ∈ GrpOp → (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
12 grpdivf.3 . . . 4 𝐷 = ( /𝑔𝐺)
131, 2, 12grpodivfval 31015 . . 3 (𝐺 ∈ GrpOp → 𝐷 = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))))
1413feq1d 6684 . 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 2145  wral 3076   × cxp 5653  ran crn 5656  wf 6529  cfv 6533  (class class class)co 7413  cmpo 7415  GrpOpcgr 30970  invcgn 30972   /𝑔 cgs 30973
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-grpo 30974  df-gid 30975  df-ginv 30976  df-gdiv 30977
This theorem is used by:  grpodivcl  31020
  Copyright terms: Public domain W3C validator