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

Theorem submaval0 18951
Description: Second substitution for a submatrix. (Contributed by AV, 28-Dec-2018.)
Hypotheses
Ref Expression
submafval.a  |-  A  =  ( N Mat  R )
submafval.q  |-  Q  =  ( N subMat  R )
submafval.b  |-  B  =  ( Base `  A
)
Assertion
Ref Expression
submaval0  |-  ( M  e.  B  ->  ( Q `  M )  =  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  {
k } ) ,  j  e.  ( N 
\  { l } )  |->  ( i M j ) ) ) )
Distinct variable groups:    i, N, j, k, l    R, i, j, k, l    i, M, j, k, l
Allowed substitution hints:    A( i, j, k, l)    B( i, j, k, l)    Q( i, j, k, l)

Proof of Theorem submaval0
Dummy variable  m is distinct from all other variables.
StepHypRef Expression
1 submafval.a . . . . 5  |-  A  =  ( N Mat  R )
2 submafval.b . . . . 5  |-  B  =  ( Base `  A
)
31, 2matrcl 18783 . . . 4  |-  ( M  e.  B  ->  ( N  e.  Fin  /\  R  e.  _V ) )
43simpld 459 . . 3  |-  ( M  e.  B  ->  N  e.  Fin )
5 mpt2exga 6871 . . 3  |-  ( ( N  e.  Fin  /\  N  e.  Fin )  ->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  { k } ) ,  j  e.  ( N  \  { l } ) 
|->  ( i M j ) ) )  e. 
_V )
64, 4, 5syl2anc 661 . 2  |-  ( M  e.  B  ->  (
k  e.  N , 
l  e.  N  |->  ( i  e.  ( N 
\  { k } ) ,  j  e.  ( N  \  {
l } )  |->  ( i M j ) ) )  e.  _V )
7 oveq 6301 . . . . 5  |-  ( m  =  M  ->  (
i m j )  =  ( i M j ) )
87mpt2eq3dv 6358 . . . 4  |-  ( m  =  M  ->  (
i  e.  ( N 
\  { k } ) ,  j  e.  ( N  \  {
l } )  |->  ( i m j ) )  =  ( i  e.  ( N  \  { k } ) ,  j  e.  ( N  \  { l } )  |->  ( i M j ) ) )
98mpt2eq3dv 6358 . . 3  |-  ( m  =  M  ->  (
k  e.  N , 
l  e.  N  |->  ( i  e.  ( N 
\  { k } ) ,  j  e.  ( N  \  {
l } )  |->  ( i m j ) ) )  =  ( k  e.  N , 
l  e.  N  |->  ( i  e.  ( N 
\  { k } ) ,  j  e.  ( N  \  {
l } )  |->  ( i M j ) ) ) )
10 submafval.q . . . 4  |-  Q  =  ( N subMat  R )
111, 10, 2submafval 18950 . . 3  |-  Q  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  { k } ) ,  j  e.  ( N  \  { l } ) 
|->  ( i m j ) ) ) )
129, 11fvmptg 5955 . 2  |-  ( ( M  e.  B  /\  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  { k } ) ,  j  e.  ( N  \  { l } ) 
|->  ( i M j ) ) )  e. 
_V )  ->  ( Q `  M )  =  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  {
k } ) ,  j  e.  ( N 
\  { l } )  |->  ( i M j ) ) ) )
136, 12mpdan 668 1  |-  ( M  e.  B  ->  ( Q `  M )  =  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  {
k } ) ,  j  e.  ( N 
\  { l } )  |->  ( i M j ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1379    e. wcel 1767   _Vcvv 3118    \ cdif 3478   {csn 4033   ` cfv 5594  (class class class)co 6295    |-> cmpt2 6297   Fincfn 7528   Basecbs 14507   Mat cmat 18778   subMat csubma 18947
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4564  ax-sep 4574  ax-nul 4582  ax-pow 4631  ax-pr 4692  ax-un 6587
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2822  df-rex 2823  df-reu 2824  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-nul 3791  df-if 3946  df-pw 4018  df-sn 4034  df-pr 4036  df-op 4040  df-uni 4252  df-iun 4333  df-br 4454  df-opab 4512  df-mpt 4513  df-id 4801  df-xp 5011  df-rel 5012  df-cnv 5013  df-co 5014  df-dm 5015  df-rn 5016  df-res 5017  df-ima 5018  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-ov 6298  df-oprab 6299  df-mpt2 6300  df-1st 6795  df-2nd 6796  df-slot 14511  df-base 14512  df-mat 18779  df-subma 18948
This theorem is referenced by:  submaval  18952
  Copyright terms: Public domain W3C validator