let n, m, k, i be Nat; :: thesis: for K being Field
for a being Element of
for A' being Matrix of the carrier of K,m,
for B' being Matrix of the carrier of K,m, st a <> 0. K holds
Solutions_of A',B' = Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i)))
let K be Field; :: thesis: for a being Element of
for A' being Matrix of the carrier of K,m,
for B' being Matrix of the carrier of K,m, st a <> 0. K holds
Solutions_of A',B' = Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i)))
let a be Element of ; :: thesis: for A' being Matrix of the carrier of K,m,
for B' being Matrix of the carrier of K,m, st a <> 0. K holds
Solutions_of A',B' = Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i)))
let A' be Matrix of the carrier of K,m,; :: thesis: for B' being Matrix of the carrier of K,m, st a <> 0. K holds
Solutions_of A',B' = Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i)))
let B' be Matrix of the carrier of K,m,; :: thesis: ( a <> 0. K implies Solutions_of A',B' = Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) )
assume A1: a <> 0. K ; :: thesis: Solutions_of A',B' = Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i)))
set RB = RLine B',i,(a * (Line B',i));
set RA = RLine A',i,(a * (Line A',i));
thus Solutions_of A',B' c= Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) :: according to XBOOLE_0:def 10 :: thesis: Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) c= Solutions_of A',B'

proof

let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Solutions_of A',B' or x in Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) )
assume A2: x in Solutions_of A',B' ; :: thesis: x in Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i)))
ex X being Matrix of st
( x = X & len X = width A' & width X = width B' & A' * X = B' ) by A2;
hence x in Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) by A2, Th38; :: thesis: verum

end;

let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) or x in Solutions_of A',B' )
assume A3: x in Solutions_of (RLine A',i,(a * (Line A',i))),(RLine B',i,(a * (Line B',i))) ; :: thesis: x in Solutions_of A',B'

per cases ( not i in Seg m or i in Seg m ) ;

suppose A4: not i in Seg m ; :: thesis: x in Solutions_of A',B'

len A' = m by MATRIX_1:def 3;
then ( len B' = m & RLine A',i,(a * (Line A',i)) = A' ) by A4, MATRIX13:40, MATRIX_1:def 3;
hence x in Solutions_of A',B' by A3, A4, MATRIX13:40; :: thesis: verum

end;

suppose A5: i in Seg m ; :: thesis: x in Solutions_of A',B'

reconsider aLA = a * (Line A',i), aLB = a * (Line B',i), aLAR = (a " ) * (Line (RLine A',i,(a * (Line A',i))),i), aLBR = (a " ) * (Line (RLine B',i,(a * (Line B',i))),i) as Element of the carrier of K * by FINSEQ_1:def 11;
set RRB = RLine (RLine B',i,(a * (Line B',i))),i,((a " ) * (Line (RLine B',i,(a * (Line B',i))),i));
set RRA = RLine (RLine A',i,(a * (Line A',i))),i,((a " ) * (Line (RLine A',i,(a * (Line A',i))),i));
A6: ex X being Matrix of st
( x = X & len X = width (RLine A',i,(a * (Line A',i))) & width X = width (RLine B',i,(a * (Line B',i))) & (RLine A',i,(a * (Line A',i))) * X = RLine B',i,(a * (Line B',i)) ) by A3;
A7: len (a * (Line A',i)) = width A' by FINSEQ_1:def 18;
then A8: (a " ) * (Line (RLine A',i,(a * (Line A',i))),i) = (a " ) * (a * (Line A',i)) by A5, MATRIX11:28
.= ((a " ) * a) * (Line A',i) by FVSUM_1:67
.= (1_ K) * (Line A',i) by A1, VECTSP_1:def 22
.= Line A',i by FVSUM_1:70 ;
A9: len (a * (Line B',i)) = width B' by FINSEQ_1:def 18;
then A10: (a " ) * (Line (RLine B',i,(a * (Line B',i))),i) = (a " ) * (a * (Line B',i)) by A5, MATRIX11:28
.= ((a " ) * a) * (Line B',i) by FVSUM_1:67
.= (1_ K) * (Line B',i) by A1, VECTSP_1:def 22
.= Line B',i by FVSUM_1:70 ;
A11: width (RLine B',i,(a * (Line B',i))) = width B' by A9, MATRIX11:def 3;
A12: len ((a " ) * (Line (RLine B',i,(a * (Line B',i))),i)) = width (RLine B',i,(a * (Line B',i))) by FINSEQ_1:def 18;
then A13: RLine (RLine B',i,(a * (Line B',i))),i,((a " ) * (Line (RLine B',i,(a * (Line B',i))),i)) = Replace (RLine B',i,(a * (Line B',i))),i,aLBR by MATRIX11:29
.= Replace (Replace B',i,aLB),i,aLBR by A9, MATRIX11:29
.= Replace B',i,aLBR by FUNCT_7:36
.= RLine B',i,(Line B',i) by A12, A11, A10, MATRIX11:29
.= B' by MATRIX11:30 ;
A14: width (RLine A',i,(a * (Line A',i))) = width A' by A7, MATRIX11:def 3;
A15: len ((a " ) * (Line (RLine A',i,(a * (Line A',i))),i)) = width (RLine A',i,(a * (Line A',i))) by FINSEQ_1:def 18;
then RLine (RLine A',i,(a * (Line A',i))),i,((a " ) * (Line (RLine A',i,(a * (Line A',i))),i)) = Replace (RLine A',i,(a * (Line A',i))),i,aLAR by MATRIX11:29
.= Replace (Replace A',i,aLA),i,aLAR by A7, MATRIX11:29
.= Replace A',i,aLAR by FUNCT_7:36
.= RLine A',i,(Line A',i) by A15, A14, A8, MATRIX11:29
.= A' by MATRIX11:30 ;
hence x in Solutions_of A',B' by A3, A6, A13, Th38; :: thesis: verum

end;

end;