let n, i, j be Nat; :: thesis: for K being Field
for a being Element of K
for R being FinSequence_of_Square-Matrix of K
for A being Matrix of n,K st i in dom A & j in Seg n holds
Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a

let K be Field; :: thesis: for a being Element of K
for R being FinSequence_of_Square-Matrix of K
for A being Matrix of n,K st i in dom A & j in Seg n holds
Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a

let a be Element of K; :: thesis: for R being FinSequence_of_Square-Matrix of K
for A being Matrix of n,K st i in dom A & j in Seg n holds
Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a

let R be FinSequence_of_Square-Matrix of K; :: thesis: for A being Matrix of n,K st i in dom A & j in Seg n holds
Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a

let A be Matrix of n,K; :: thesis: ( i in dom A & j in Seg n implies Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a )
assume that
A1: i in dom A and
A2: j in Seg n ; :: thesis: Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a
n <> 0 by A2;
then A3: n >= 1 by A2, FINSEQ_1:4, NAT_1:14;
set jS = j + (Sum (Len R));
set iS = i + (Sum (Len R));
set AA = <*A*>;
set b = block_diagonal R,a;
set B = <*(block_diagonal R,a)*>;
set LRA = Sum (Len (R ^ <*A*>));
set LBA = Sum (Len (<*(block_diagonal R,a)*> ^ <*A*>));
A4: width A = n by MATRIX_1:25;
A5: Len R = Width R by Th46;
A6: len A = n by MATRIX_1:25;
then A7: dom A = Seg n by FINSEQ_1:def 3;
A8: Width <*A*> = <*(width A)*> by Th19;
A9: len (block_diagonal R,a) = Sum (Len R) by Def5;
A10: Len (<*(block_diagonal R,a)*> ^ <*A*>) = Width (<*(block_diagonal R,a)*> ^ <*A*>) by Th46;
A11: Len <*A*> = <*(len A)*> by Th15;
then A12: Sum (Len <*A*>) = len A by RVSUM_1:103;
Len (R ^ <*A*>) = (Len R) ^ (Len <*A*>) by Th14;
then A13: Sum (Len (R ^ <*A*>)) = (len A) + (Sum (Len R)) by A11, RVSUM_1:104;
Len (<*(block_diagonal R,a)*> ^ <*A*>) = (Len <*(block_diagonal R,a)*>) ^ (Len <*A*>) by Th14;
then A14: Sum (Len (<*(block_diagonal R,a)*> ^ <*A*>)) = (len A) + (Sum (Len <*(block_diagonal R,a)*>)) by A11, RVSUM_1:104;
A15: Width <*(block_diagonal R,a)*> = <*(width (block_diagonal R,a))*> by Th19;
then A16: Sum (Width <*(block_diagonal R,a)*>) = width (block_diagonal R,a) by RVSUM_1:103;
Width (<*(block_diagonal R,a)*> ^ <*A*>) = (Width <*(block_diagonal R,a)*>) ^ (Width <*A*>) by Th18;
then A17: Sum (Len (<*(block_diagonal R,a)*> ^ <*A*>)) = (Sum (Width <*A*>)) + (width (block_diagonal R,a)) by A15, A10, RVSUM_1:106;
Len <*(block_diagonal R,a)*> = <*(len (block_diagonal R,a))*> by Th15;
then A18: Sum (Len <*(block_diagonal R,a)*>) = len (block_diagonal R,a) by RVSUM_1:103;
per cases ( n = 1 or n > 1 ) by A3, XXREAL_0:1;
suppose A19: n = 1 ; :: thesis: Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a
end;
suppose n > 1 ; :: thesis: Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = block_diagonal (R ^ <*(Deleting A,i,j)*>),a
then A23: width A = width (DelLine A,i) by A6, LAPLACE:4;
thus Deleting (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R))),(j + (Sum (Len R))) = DelCol (DelLine (block_diagonal (R ^ <*A*>),a),(i + (Sum (Len R)))),(j + (Sum (Len R))) by MATRIX_2:def 8
.= DelCol (block_diagonal (R ^ <*(DelLine A,i)*>),a),(j + (Sum (Len R))) by A1, A23, Th42
.= block_diagonal (R ^ <*(DelCol (DelLine A,i),j)*>),a by A2, A4, A5, A23, Th44
.= block_diagonal (R ^ <*(Deleting A,i,j)*>),a by MATRIX_2:def 8 ; :: thesis: verum
end;
end;