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

Theorem minmar1fval 19440
Description: First substitution for the definition of a matrix for a minor. (Contributed by AV, 31-Dec-2018.)
Hypotheses
Ref Expression
minmar1fval.a  |-  A  =  ( N Mat  R )
minmar1fval.b  |-  B  =  ( Base `  A
)
minmar1fval.q  |-  Q  =  ( N minMatR1  R )
minmar1fval.o  |-  .1.  =  ( 1r `  R )
minmar1fval.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
minmar1fval  |-  Q  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) )
Distinct variable groups:    B, m    i, N, j, k, l, m    R, i, j, k, l, m
Allowed substitution hints:    A( i, j, k, m, l)    B( i, j, k, l)    Q( i, j, k, m, l)    .1. ( i, j, k, m, l)    .0. ( i, j, k, m, l)

Proof of Theorem minmar1fval
Dummy variables  n  r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 minmar1fval.q . 2  |-  Q  =  ( N minMatR1  R )
2 oveq12 6287 . . . . . . . 8  |-  ( ( n  =  N  /\  r  =  R )  ->  ( n Mat  r )  =  ( N Mat  R
) )
3 minmar1fval.a . . . . . . . 8  |-  A  =  ( N Mat  R )
42, 3syl6eqr 2461 . . . . . . 7  |-  ( ( n  =  N  /\  r  =  R )  ->  ( n Mat  r )  =  A )
54fveq2d 5853 . . . . . 6  |-  ( ( n  =  N  /\  r  =  R )  ->  ( Base `  (
n Mat  r ) )  =  ( Base `  A
) )
6 minmar1fval.b . . . . . 6  |-  B  =  ( Base `  A
)
75, 6syl6eqr 2461 . . . . 5  |-  ( ( n  =  N  /\  r  =  R )  ->  ( Base `  (
n Mat  r ) )  =  B )
8 simpl 455 . . . . . 6  |-  ( ( n  =  N  /\  r  =  R )  ->  n  =  N )
9 fveq2 5849 . . . . . . . . . . 11  |-  ( r  =  R  ->  ( 1r `  r )  =  ( 1r `  R
) )
10 minmar1fval.o . . . . . . . . . . 11  |-  .1.  =  ( 1r `  R )
119, 10syl6eqr 2461 . . . . . . . . . 10  |-  ( r  =  R  ->  ( 1r `  r )  =  .1.  )
12 fveq2 5849 . . . . . . . . . . 11  |-  ( r  =  R  ->  ( 0g `  r )  =  ( 0g `  R
) )
13 minmar1fval.z . . . . . . . . . . 11  |-  .0.  =  ( 0g `  R )
1412, 13syl6eqr 2461 . . . . . . . . . 10  |-  ( r  =  R  ->  ( 0g `  r )  =  .0.  )
1511, 14ifeq12d 3905 . . . . . . . . 9  |-  ( r  =  R  ->  if ( j  =  l ,  ( 1r `  r ) ,  ( 0g `  r ) )  =  if ( j  =  l ,  .1.  ,  .0.  )
)
1615ifeq1d 3903 . . . . . . . 8  |-  ( r  =  R  ->  if ( i  =  k ,  if ( j  =  l ,  ( 1r `  r ) ,  ( 0g `  r ) ) ,  ( i m j ) )  =  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) )
1716adantl 464 . . . . . . 7  |-  ( ( n  =  N  /\  r  =  R )  ->  if ( i  =  k ,  if ( j  =  l ,  ( 1r `  r
) ,  ( 0g
`  r ) ) ,  ( i m j ) )  =  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) )
188, 8, 17mpt2eq123dv 6340 . . . . . 6  |-  ( ( n  =  N  /\  r  =  R )  ->  ( i  e.  n ,  j  e.  n  |->  if ( i  =  k ,  if ( j  =  l ,  ( 1r `  r
) ,  ( 0g
`  r ) ) ,  ( i m j ) ) )  =  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i
m j ) ) ) )
198, 8, 18mpt2eq123dv 6340 . . . . 5  |-  ( ( n  =  N  /\  r  =  R )  ->  ( k  e.  n ,  l  e.  n  |->  ( i  e.  n ,  j  e.  n  |->  if ( i  =  k ,  if ( j  =  l ,  ( 1r `  r
) ,  ( 0g
`  r ) ) ,  ( i m j ) ) ) )  =  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) )
207, 19mpteq12dv 4473 . . . 4  |-  ( ( n  =  N  /\  r  =  R )  ->  ( m  e.  (
Base `  ( n Mat  r ) )  |->  ( k  e.  n ,  l  e.  n  |->  ( i  e.  n ,  j  e.  n  |->  if ( i  =  k ,  if ( j  =  l ,  ( 1r `  r ) ,  ( 0g `  r ) ) ,  ( i m j ) ) ) ) )  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) ) )
21 df-minmar1 19429 . . . 4  |- minMatR1  =  ( n  e.  _V , 
r  e.  _V  |->  ( m  e.  ( Base `  ( n Mat  r ) )  |->  ( k  e.  n ,  l  e.  n  |->  ( i  e.  n ,  j  e.  n  |->  if ( i  =  k ,  if ( j  =  l ,  ( 1r `  r ) ,  ( 0g `  r ) ) ,  ( i m j ) ) ) ) ) )
22 fvex 5859 . . . . . 6  |-  ( Base `  A )  e.  _V
236, 22eqeltri 2486 . . . . 5  |-  B  e. 
_V
2423mptex 6124 . . . 4  |-  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) )  e. 
_V
2520, 21, 24ovmpt2a 6414 . . 3  |-  ( ( N  e.  _V  /\  R  e.  _V )  ->  ( N minMatR1  R )  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i
m j ) ) ) ) ) )
2621mpt2ndm0 6497 . . . . 5  |-  ( -.  ( N  e.  _V  /\  R  e.  _V )  ->  ( N minMatR1  R )  =  (/) )
27 mpt0 5691 . . . . 5  |-  ( m  e.  (/)  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i
m j ) ) ) ) )  =  (/)
2826, 27syl6eqr 2461 . . . 4  |-  ( -.  ( N  e.  _V  /\  R  e.  _V )  ->  ( N minMatR1  R )  =  ( m  e.  (/)  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i
m j ) ) ) ) ) )
293fveq2i 5852 . . . . . . 7  |-  ( Base `  A )  =  (
Base `  ( N Mat  R ) )
306, 29eqtri 2431 . . . . . 6  |-  B  =  ( Base `  ( N Mat  R ) )
31 matbas0pc 19203 . . . . . 6  |-  ( -.  ( N  e.  _V  /\  R  e.  _V )  ->  ( Base `  ( N Mat  R ) )  =  (/) )
3230, 31syl5eq 2455 . . . . 5  |-  ( -.  ( N  e.  _V  /\  R  e.  _V )  ->  B  =  (/) )
3332mpteq1d 4476 . . . 4  |-  ( -.  ( N  e.  _V  /\  R  e.  _V )  ->  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) )  =  ( m  e.  (/)  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) ) )
3428, 33eqtr4d 2446 . . 3  |-  ( -.  ( N  e.  _V  /\  R  e.  _V )  ->  ( N minMatR1  R )  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i
m j ) ) ) ) ) )
3525, 34pm2.61i 164 . 2  |-  ( N minMatR1  R )  =  ( m  e.  B  |->  ( k  e.  N , 
l  e.  N  |->  ( i  e.  N , 
j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) )
361, 35eqtri 2431 1  |-  Q  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  N ,  j  e.  N  |->  if ( i  =  k ,  if ( j  =  l ,  .1.  ,  .0.  ) ,  ( i m j ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    /\ wa 367    = wceq 1405    e. wcel 1842   _Vcvv 3059   (/)c0 3738   ifcif 3885    |-> cmpt 4453   ` cfv 5569  (class class class)co 6278    |-> cmpt2 6280   Basecbs 14841   0gc0g 15054   1rcur 17473   Mat cmat 19201   minMatR1 cminmar1 19427
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-8 1844  ax-9 1846  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380  ax-rep 4507  ax-sep 4517  ax-nul 4525  ax-pow 4572  ax-pr 4630
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 976  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-eu 2242  df-mo 2243  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-ne 2600  df-ral 2759  df-rex 2760  df-reu 2761  df-rab 2763  df-v 3061  df-sbc 3278  df-csb 3374  df-dif 3417  df-un 3419  df-in 3421  df-ss 3428  df-nul 3739  df-if 3886  df-sn 3973  df-pr 3975  df-op 3979  df-uni 4192  df-iun 4273  df-br 4396  df-opab 4454  df-mpt 4455  df-id 4738  df-xp 4829  df-rel 4830  df-cnv 4831  df-co 4832  df-dm 4833  df-rn 4834  df-res 4835  df-ima 4836  df-iota 5533  df-fun 5571  df-fn 5572  df-f 5573  df-f1 5574  df-fo 5575  df-f1o 5576  df-fv 5577  df-ov 6281  df-oprab 6282  df-mpt2 6283  df-slot 14845  df-base 14846  df-mat 19202  df-minmar1 19429
This theorem is referenced by:  minmar1val0  19441
  Copyright terms: Public domain W3C validator