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

Theorem mdetleib1 19263
Description: Full substitution of an alternative determinant definition (also known as Leibniz' Formula). (Contributed by Stefan O'Rear, 3-Oct-2015.) (Revised by AV, 26-Dec-2018.)
Hypotheses
Ref Expression
mdetfval1.d  |-  D  =  ( N maDet  R )
mdetfval1.a  |-  A  =  ( N Mat  R )
mdetfval1.b  |-  B  =  ( Base `  A
)
mdetfval1.p  |-  P  =  ( Base `  ( SymGrp `
 N ) )
mdetfval1.y  |-  Y  =  ( ZRHom `  R
)
mdetfval1.s  |-  S  =  (pmSgn `  N )
mdetfval1.t  |-  .x.  =  ( .r `  R )
mdetfval1.u  |-  U  =  (mulGrp `  R )
Assertion
Ref Expression
mdetleib1  |-  ( M  e.  B  ->  ( D `  M )  =  ( R  gsumg  ( p  e.  P  |->  ( ( Y `  ( S `
 p ) ) 
.x.  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) ) ) ) )
Distinct variable groups:    B, p    x, p, N    P, p    R, p, x    M, p, x
Allowed substitution hints:    A( x, p)    B( x)    D( x, p)    P( x)    S( x, p)    .x. ( x, p)    U( x, p)    Y( x, p)

Proof of Theorem mdetleib1
Dummy variable  m is distinct from all other variables.
StepHypRef Expression
1 oveq 6276 . . . . . . 7  |-  ( m  =  M  ->  (
( p `  x
) m x )  =  ( ( p `
 x ) M x ) )
21mpteq2dv 4526 . . . . . 6  |-  ( m  =  M  ->  (
x  e.  N  |->  ( ( p `  x
) m x ) )  =  ( x  e.  N  |->  ( ( p `  x ) M x ) ) )
32oveq2d 6286 . . . . 5  |-  ( m  =  M  ->  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x ) m x ) ) )  =  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) )
43oveq2d 6286 . . . 4  |-  ( m  =  M  ->  (
( Y `  ( S `  p )
)  .x.  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x
) m x ) ) ) )  =  ( ( Y `  ( S `  p ) )  .x.  ( U 
gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) ) )
54mpteq2dv 4526 . . 3  |-  ( m  =  M  ->  (
p  e.  P  |->  ( ( Y `  ( S `  p )
)  .x.  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x
) m x ) ) ) ) )  =  ( p  e.  P  |->  ( ( Y `
 ( S `  p ) )  .x.  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) ) ) )
65oveq2d 6286 . 2  |-  ( m  =  M  ->  ( R  gsumg  ( p  e.  P  |->  ( ( Y `  ( S `  p ) )  .x.  ( U 
gsumg  ( x  e.  N  |->  ( ( p `  x ) m x ) ) ) ) ) )  =  ( R  gsumg  ( p  e.  P  |->  ( ( Y `  ( S `  p ) )  .x.  ( U 
gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) ) ) ) )
7 mdetfval1.d . . 3  |-  D  =  ( N maDet  R )
8 mdetfval1.a . . 3  |-  A  =  ( N Mat  R )
9 mdetfval1.b . . 3  |-  B  =  ( Base `  A
)
10 mdetfval1.p . . 3  |-  P  =  ( Base `  ( SymGrp `
 N ) )
11 mdetfval1.y . . 3  |-  Y  =  ( ZRHom `  R
)
12 mdetfval1.s . . 3  |-  S  =  (pmSgn `  N )
13 mdetfval1.t . . 3  |-  .x.  =  ( .r `  R )
14 mdetfval1.u . . 3  |-  U  =  (mulGrp `  R )
157, 8, 9, 10, 11, 12, 13, 14mdetfval1 19262 . 2  |-  D  =  ( m  e.  B  |->  ( R  gsumg  ( p  e.  P  |->  ( ( Y `  ( S `  p ) )  .x.  ( U 
gsumg  ( x  e.  N  |->  ( ( p `  x ) m x ) ) ) ) ) ) )
16 ovex 6298 . 2  |-  ( R 
gsumg  ( p  e.  P  |->  ( ( Y `  ( S `  p ) )  .x.  ( U 
gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) ) ) )  e.  _V
176, 15, 16fvmpt 5931 1  |-  ( M  e.  B  ->  ( D `  M )  =  ( R  gsumg  ( p  e.  P  |->  ( ( Y `  ( S `
 p ) ) 
.x.  ( U  gsumg  ( x  e.  N  |->  ( ( p `  x ) M x ) ) ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 1823    |-> cmpt 4497   ` cfv 5570  (class class class)co 6270   Basecbs 14719   .rcmulr 14788    gsumg cgsu 14933   SymGrpcsymg 16604  pmSgncpsgn 16716  mulGrpcmgp 17339   ZRHomczrh 18715   Mat cmat 19079   maDet cmdat 19256
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565  ax-cnex 9537  ax-resscn 9538  ax-1cn 9539  ax-icn 9540  ax-addcl 9541  ax-addrcl 9542  ax-mulcl 9543  ax-mulrcl 9544  ax-mulcom 9545  ax-addass 9546  ax-mulass 9547  ax-distr 9548  ax-i2m1 9549  ax-1ne0 9550  ax-1rid 9551  ax-rnegex 9552  ax-rrecex 9553  ax-cnre 9554  ax-pre-lttri 9555  ax-pre-lttrn 9556  ax-pre-ltadd 9557  ax-pre-mulgt0 9558
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-nel 2652  df-ral 2809  df-rex 2810  df-reu 2811  df-rmo 2812  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-tp 4021  df-op 4023  df-uni 4236  df-int 4272  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-tr 4533  df-eprel 4780  df-id 4784  df-po 4789  df-so 4790  df-fr 4827  df-we 4829  df-ord 4870  df-on 4871  df-lim 4872  df-suc 4873  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-riota 6232  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-om 6674  df-1st 6773  df-2nd 6774  df-recs 7034  df-rdg 7068  df-1o 7122  df-oadd 7126  df-er 7303  df-map 7414  df-en 7510  df-dom 7511  df-sdom 7512  df-fin 7513  df-card 8311  df-cda 8539  df-pnf 9619  df-mnf 9620  df-xr 9621  df-ltxr 9622  df-le 9623  df-sub 9798  df-neg 9799  df-nn 10532  df-2 10590  df-3 10591  df-4 10592  df-5 10593  df-6 10594  df-7 10595  df-8 10596  df-9 10597  df-n0 10792  df-z 10861  df-uz 11083  df-fz 11676  df-fzo 11800  df-hash 12391  df-word 12529  df-struct 14721  df-ndx 14722  df-slot 14723  df-base 14724  df-plusg 14800  df-tset 14806  df-symg 16605  df-psgn 16718  df-mat 19080  df-mdet 19257
This theorem is referenced by:  m2detleib  19303
  Copyright terms: Public domain W3C validator