let V1 be free finite-rank Z_Module; :: thesis: for a being Element of V1
for F being FinSequence of INT.Ring
for G being FinSequence of V1 st len F = len G & ( for k being Nat st k in dom F holds
G . k = (F /. k) * a ) holds
Sum G = (Sum F) * a
let a be Element of V1; :: thesis: for F being FinSequence of INT.Ring
for G being FinSequence of V1 st len F = len G & ( for k being Nat st k in dom F holds
G . k = (F /. k) * a ) holds
Sum G = (Sum F) * a
let F be FinSequence of INT.Ring; :: thesis: for G being FinSequence of V1 st len F = len G & ( for k being Nat st k in dom F holds
G . k = (F /. k) * a ) holds
Sum G = (Sum F) * a
let G be FinSequence of V1; :: thesis: ( len F = len G & ( for k being Nat st k in dom F holds
G . k = (F /. k) * a ) implies Sum G = (Sum F) * a )
assume that
A1: len F = len G and
A2: for k being Nat st k in dom F holds
G . k = (F /. k) * a ; :: thesis: Sum G = (Sum F) * a
now :: thesis: for k being Nat
for v being Element of INT.Ring st k in dom G & v = F . k holds
G . k = v * a
let k be Nat; :: thesis: for v being Element of INT.Ring st k in dom G & v = F . k holds
G . k = v * a
let v be Element of INT.Ring; :: thesis: ( k in dom G & v = F . k implies G . k = v * a )
assume that
A3: k in dom G and
A4: v = F . k ; :: thesis: G . k = v * a
A5: k in dom F by A1, A3, FINSEQ_3:29;
then v = F /. k by A4, PARTFUN1:def 6;
hence G . k = v * a by A2, A5; :: thesis: verum
end;
hence Sum G = (Sum F) * a by A1, Th9; :: thesis: verum