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

Theorem grpodivf 21834
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  |-  X  =  ran  G
grpdivf.3  |-  D  =  (  /g  `  G
)
Assertion
Ref Expression
grpodivf  |-  ( G  e.  GrpOp  ->  D :
( X  X.  X
) --> X )

Proof of Theorem grpodivf
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpdivf.1 . . . . . . . 8  |-  X  =  ran  G
2 eqid 2436 . . . . . . . 8  |-  ( inv `  G )  =  ( inv `  G )
31, 2grpoinvcl 21814 . . . . . . 7  |-  ( ( G  e.  GrpOp  /\  y  e.  X )  ->  (
( inv `  G
) `  y )  e.  X )
433adant2 976 . . . . . 6  |-  ( ( G  e.  GrpOp  /\  x  e.  X  /\  y  e.  X )  ->  (
( inv `  G
) `  y )  e.  X )
51grpocl 21788 . . . . . 6  |-  ( ( G  e.  GrpOp  /\  x  e.  X  /\  (
( inv `  G
) `  y )  e.  X )  ->  (
x G ( ( inv `  G ) `
 y ) )  e.  X )
64, 5syld3an3 1229 . . . . 5  |-  ( ( G  e.  GrpOp  /\  x  e.  X  /\  y  e.  X )  ->  (
x G ( ( inv `  G ) `
 y ) )  e.  X )
763expib 1156 . . . 4  |-  ( G  e.  GrpOp  ->  ( (
x  e.  X  /\  y  e.  X )  ->  ( x G ( ( inv `  G
) `  y )
)  e.  X ) )
87ralrimivv 2797 . . 3  |-  ( G  e.  GrpOp  ->  A. x  e.  X  A. y  e.  X  ( x G ( ( inv `  G ) `  y
) )  e.  X
)
9 eqid 2436 . . . 4  |-  ( x  e.  X ,  y  e.  X  |->  ( x G ( ( inv `  G ) `  y
) ) )  =  ( x  e.  X ,  y  e.  X  |->  ( x G ( ( inv `  G
) `  y )
) )
109fmpt2 6418 . . 3  |-  ( A. x  e.  X  A. y  e.  X  (
x G ( ( inv `  G ) `
 y ) )  e.  X  <->  ( x  e.  X ,  y  e.  X  |->  ( x G ( ( inv `  G
) `  y )
) ) : ( X  X.  X ) --> X )
118, 10sylib 189 . 2  |-  ( G  e.  GrpOp  ->  ( x  e.  X ,  y  e.  X  |->  ( x G ( ( inv `  G
) `  y )
) ) : ( X  X.  X ) --> X )
12 grpdivf.3 . . . 4  |-  D  =  (  /g  `  G
)
131, 2, 12grpodivfval 21830 . . 3  |-  ( G  e.  GrpOp  ->  D  =  ( x  e.  X ,  y  e.  X  |->  ( x G ( ( inv `  G
) `  y )
) ) )
1413feq1d 5580 . 2  |-  ( G  e.  GrpOp  ->  ( D : ( X  X.  X ) --> X  <->  ( x  e.  X ,  y  e.  X  |->  ( x G ( ( inv `  G
) `  y )
) ) : ( X  X.  X ) --> X ) )
1511, 14mpbird 224 1  |-  ( G  e.  GrpOp  ->  D :
( X  X.  X
) --> X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1652    e. wcel 1725   A.wral 2705    X. cxp 4876   ran crn 4879   -->wf 5450   ` cfv 5454  (class class class)co 6081    e. cmpt2 6083   GrpOpcgr 21774   invcgn 21776    /g cgs 21777
This theorem is referenced by:  grpodivcl  21835
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-rep 4320  ax-sep 4330  ax-nul 4338  ax-pow 4377  ax-pr 4403  ax-un 4701
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2285  df-mo 2286  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2710  df-rex 2711  df-reu 2712  df-rab 2714  df-v 2958  df-sbc 3162  df-csb 3252  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-pw 3801  df-sn 3820  df-pr 3821  df-op 3823  df-uni 4016  df-iun 4095  df-br 4213  df-opab 4267  df-mpt 4268  df-id 4498  df-xp 4884  df-rel 4885  df-cnv 4886  df-co 4887  df-dm 4888  df-rn 4889  df-res 4890  df-ima 4891  df-iota 5418  df-fun 5456  df-fn 5457  df-f 5458  df-f1 5459  df-fo 5460  df-f1o 5461  df-fv 5462  df-ov 6084  df-oprab 6085  df-mpt2 6086  df-1st 6349  df-2nd 6350  df-riota 6549  df-grpo 21779  df-gid 21780  df-ginv 21781  df-gdiv 21782
  Copyright terms: Public domain W3C validator