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

Theorem submaval0 18528
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 18447 . . . 4  |-  ( M  e.  B  ->  ( N  e.  Fin  /\  R  e.  _V ) )
43simpld 459 . . 3  |-  ( M  e.  B  ->  N  e.  Fin )
5 mpt2exga 6762 . . 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 6209 . . . . 5  |-  ( m  =  M  ->  (
i m j )  =  ( i M j ) )
87mpt2eq3dv 6264 . . . 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 6264 . . 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 18527 . . 3  |-  Q  =  ( m  e.  B  |->  ( k  e.  N ,  l  e.  N  |->  ( i  e.  ( N  \  { k } ) ,  j  e.  ( N  \  { l } ) 
|->  ( i m j ) ) ) )
129, 11fvmptg 5884 . 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 1370    e. wcel 1758   _Vcvv 3078    \ cdif 3436   {csn 3988   ` cfv 5529  (class class class)co 6203    |-> cmpt2 6205   Fincfn 7423   Basecbs 14296   Mat cmat 18415   subMat csubma 18524
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-rep 4514  ax-sep 4524  ax-nul 4532  ax-pow 4581  ax-pr 4642  ax-un 6485
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-ral 2804  df-rex 2805  df-reu 2806  df-rab 2808  df-v 3080  df-sbc 3295  df-csb 3399  df-dif 3442  df-un 3444  df-in 3446  df-ss 3453  df-nul 3749  df-if 3903  df-pw 3973  df-sn 3989  df-pr 3991  df-op 3995  df-uni 4203  df-iun 4284  df-br 4404  df-opab 4462  df-mpt 4463  df-id 4747  df-xp 4957  df-rel 4958  df-cnv 4959  df-co 4960  df-dm 4961  df-rn 4962  df-res 4963  df-ima 4964  df-iota 5492  df-fun 5531  df-fn 5532  df-f 5533  df-f1 5534  df-fo 5535  df-f1o 5536  df-fv 5537  df-ov 6206  df-oprab 6207  df-mpt2 6208  df-1st 6690  df-2nd 6691  df-slot 14300  df-base 14301  df-mat 18417  df-subma 18525
This theorem is referenced by:  submaval  18529
  Copyright terms: Public domain W3C validator