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

let f be sequence of R; :: thesis: ( f is descending implies for s being subsequence of f holds s is descending )
assume A1: f is descending ; :: thesis: for s being subsequence of f holds s is descending
let s be subsequence of f; :: thesis: s is descending
for n being Nat holds
( s . (n + 1) <> s . n & [(s . (n + 1)),(s . n)] in the InternalRel of R )
proof
let n be Nat; :: thesis: ( s . (n + 1) <> s . n & [(s . (n + 1)),(s . n)] 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 by ORDINAL1:def 12;
A5: ( s . n = f . (N . n) & s . (n + 1) = f . (N . (n + 1)) ) by A2, ORDINAL1:def 12, FUNCT_2:15;
n < n + 1 by NAT_1:13;
then N . n < N . (n + 1) by A4, A3, VALUED_0:def 13;
hence ( s . (n + 1) <> s . n & [(s . (n + 1)),(s . n)] in the InternalRel of R ) by A5, A1, BAGORDER:8; :: thesis: verum
end;
hence s is descending by WELLFND1:def 6; :: thesis: verum