let R be non empty transitive RelStr ; :: thesis: for f being sequence of R st f is weakly-ascending holds
for i, j being Element of NAT st i < j holds
f . i <= f . j
let f be sequence of R; :: thesis: ( f is weakly-ascending implies for i, j being Element of NAT st i < j holds
f . i <= f . j )
assume A1: f is weakly-ascending ; :: thesis: for i, j being Element of NAT st i < j holds
f . i <= f . j
let i be Element of NAT ; :: thesis: for j being Element of NAT st i < j holds
f . i <= f . j
defpred S₁[ Element of NAT ] means ( i < $1 implies f . i <= f . $1 );
A2: S₁[ 0 ] by NAT_1:2;
A3: for j being Element of NAT st S₁[j] holds
S₁[j + 1]

proof

let j be Element of NAT ; :: thesis: ( S₁[j] implies S₁[j + 1] )
assume that
A4: S₁[j] and
A5: i < j + 1 ; :: thesis: f . i <= f . (j + 1)
reconsider fj1 = f . (j + 1) as Element of R ;
A6: [(f . j),(f . (j + 1))] in the InternalRel of R by A1, Def2;
then A7: f . j <= fj1 by ORDERS_2:def 5;
A8: i <= j by A5, NAT_1:13;

per cases ( i < j or i = j ) by A8, XXREAL_0:1;

suppose i < j ; :: thesis: f . i <= f . (j + 1)

hence f . i <= f . (j + 1) by A4, A7, ORDERS_2:3; :: thesis: verum

end;

suppose i = j ; :: thesis: f . i <= f . (j + 1)

hence f . i <= f . (j + 1) by A6, ORDERS_2:def 5; :: thesis: verum

end;

end;

end;

thus for j being Element of NAT holds S₁[j] from NAT_1:sch 1(A2, A3); :: thesis: verum