let R be RelStr ; :: thesis: for X, Y being Subset of R st X c= Y & Y is well_founded holds
X is well_founded

let X, Y be Subset of R; :: thesis: ( X c= Y & Y is well_founded implies X is well_founded )
assume A1: ( X c= Y & Y is well_founded ) ; :: thesis: X is well_founded
assume A2: not X is well_founded ; :: thesis: contradiction
then X <> {} R by Th11;
then A3: not R is empty ;
then consider f being sequence of R such that
A4: ( rng f c= X & f is descending ) by A2, Th12;
rng f c= Y by A1, A4;
hence contradiction by A3, A4, A1, Th12; :: thesis: verum