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

Theorem grpodivf 28315
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 2821 . . . . . . . 8 (inv‘𝐺) = (inv‘𝐺)
31, 2grpoinvcl 28301 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
433adant2 1127 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋𝑦𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
51grpocl 28277 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋 ∧ ((inv‘𝐺)‘𝑦) ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
64, 5syld3an3 1405 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋𝑦𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
763expib 1118 . . . 4 (𝐺 ∈ GrpOp → ((𝑥𝑋𝑦𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋))
87ralrimivv 3190 . . 3 (𝐺 ∈ GrpOp → ∀𝑥𝑋𝑦𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
9 eqid 2821 . . . 4 (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))) = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))
109fmpo 7766 . . 3 (∀𝑥𝑋𝑦𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋 ↔ (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
118, 10sylib 220 . 2 (𝐺 ∈ GrpOp → (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
12 grpdivf.3 . . . 4 𝐷 = ( /𝑔𝐺)
131, 2, 12grpodivfval 28311 . . 3 (𝐺 ∈ GrpOp → 𝐷 = (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))))
1413feq1d 6499 . 2 (𝐺 ∈ GrpOp → (𝐷:(𝑋 × 𝑋)⟶𝑋 ↔ (𝑥𝑋, 𝑦𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋))
1511, 14mpbird 259 1 (𝐺 ∈ GrpOp → 𝐷:(𝑋 × 𝑋)⟶𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  wral 3138   × cxp 5553  ran crn 5556  wf 6351  cfv 6355  (class class class)co 7156  cmpo 7158  GrpOpcgr 28266  invcgn 28268   /𝑔 cgs 28269
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-1st 7689  df-2nd 7690  df-grpo 28270  df-gid 28271  df-ginv 28272  df-gdiv 28273
This theorem is referenced by:  grpodivcl  28316
  Copyright terms: Public domain W3C validator