let D be non empty set ; :: thesis: for f being FinSequence of D
for k being Nat st 1 <= k holds
mid f,1,k = f | k
let f be FinSequence of D; :: thesis: for k being Nat st 1 <= k holds
mid f,1,k = f | k
let k be Nat; :: thesis: ( 1 <= k implies mid f,1,k = f | k )
assume A1: 1 <= k ; :: thesis: mid f,1,k = f | k
then A2: mid f,1,k = (f /^ (1 -' 1)) | ((k -' 1) + 1) by Def1;
1 -' 1 = 0 by XREAL_1:234;
then f /^ (1 -' 1) = f by FINSEQ_5:31;
hence mid f,1,k = f | k by A1, A2, XREAL_1:237; :: thesis: verum