let k, m, n be Nat; :: thesis: for D being non empty set
for A being Matrix of n,m,D
for B being Matrix of n,k,D
for i being Nat st i in Seg () holds
Col ((A ^^ B),i) = Col (A,i)

let D be non empty set ; :: thesis: for A being Matrix of n,m,D
for B being Matrix of n,k,D
for i being Nat st i in Seg () holds
Col ((A ^^ B),i) = Col (A,i)

let A be Matrix of n,m,D; :: thesis: for B being Matrix of n,k,D
for i being Nat st i in Seg () holds
Col ((A ^^ B),i) = Col (A,i)

let B be Matrix of n,k,D; :: thesis: for i being Nat st i in Seg () holds
Col ((A ^^ B),i) = Col (A,i)

let i be Nat; :: thesis: ( i in Seg () implies Col ((A ^^ B),i) = Col (A,i) )
assume A1: i in Seg () ; :: thesis: Col ((A ^^ B),i) = Col (A,i)
set AB = A ^^ B;
A2: len (A ^^ B) = n by MATRIX_0:def 2;
A3: len A = n by MATRIX_0:def 2;
now :: thesis: for j being Nat st j in Seg n holds
(Col ((A ^^ B),i)) . j = (Col (A,i)) . j
let j be Nat; :: thesis: ( j in Seg n implies (Col ((A ^^ B),i)) . j = (Col (A,i)) . j )
assume A4: j in Seg n ; :: thesis: (Col ((A ^^ B),i)) . j = (Col (A,i)) . j
n <> 0 by A4;
then width (A ^^ B) = () + () by MATRIX_0:23;
then width A <= width (A ^^ B) by NAT_1:11;
then A5: Seg () c= Seg (width (A ^^ B)) by FINSEQ_1:5;
A6: dom A = Seg n by ;
A7: dom (Line (A,j)) = Seg () by FINSEQ_2:124;
dom (A ^^ B) = Seg n by ;
hence (Col ((A ^^ B),i)) . j = (A ^^ B) * (j,i) by
.= (Line ((A ^^ B),j)) . i by
.= ((Line (A,j)) ^ (Line (B,j))) . i by
.= (Line (A,j)) . i by
.= A * (j,i) by
.= (Col (A,i)) . j by ;
:: thesis: verum
end;
hence Col ((A ^^ B),i) = Col (A,i) by ; :: thesis: verum