let R be non empty transitive RelStr ; :: thesis: for f being sequence of R st f is non-descending holds
for s being subsequence of f holds s is non-descending

let f be sequence of R; :: thesis: ( f is non-descending implies for s being subsequence of f holds s is non-descending )
assume A1: f is non-descending ; :: thesis: for s being subsequence of f holds s is non-descending
let s be subsequence of f; :: thesis: s is non-descending
for n being Nat holds [(s . n),(s . (n + 1))] in the InternalRel of R
proof
let n be Nat; :: thesis: [(s . n),(s . (n + 1))] in the InternalRel of R
set n1 = n + 1;
consider N being increasing sequence of NAT such that
A2: s = f * N by VALUED_0:def 17;
A3: dom N = NAT by FUNCT_2:def 1;
A4: ( n in NAT & n in NAT ) by ORDINAL1:def 12;
A5: ( s . n = f . (N . n) & s . (n + 1) = f . (N . (n + 1)) ) by ORDINAL1:def 12, A2, FUNCT_2:15;
n < n + 1 by NAT_1:13;
hence [(s . n),(s . (n + 1))] in the InternalRel of R by A5, A1, A4, A3, VALUED_0:def 13, Th18; :: thesis: verum
end;
hence s is non-descending ; :: thesis: verum