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

let X, Y be Subset of R; :: thesis: ( X c= Y & Y is well-ordering implies X is well-ordering )
assume A1: ( X c= Y & Y is well-ordering ) ; :: thesis: X is well-ordering
set I = the InternalRel of R;
A2: ( the InternalRel of R is_reflexive_in Y & the InternalRel of R is_transitive_in Y & the InternalRel of R is_antisymmetric_in Y & the InternalRel of R is_connected_in Y & the InternalRel of R is_well_founded_in Y ) by A1, WELLORD1:def 5;
then X is well_founded by A1, Th15, WELLFND1:def 3;
then ( the InternalRel of R is_reflexive_in X & the InternalRel of R is_transitive_in X & the InternalRel of R is_antisymmetric_in X & the InternalRel of R is_connected_in X & the InternalRel of R is_well_founded_in X ) by A2, A1, ORDERS_1:8, ORDERS_1:9, ORDERS_1:10, ORDERS_1:76, WELLFND1:def 3;
hence X is well-ordering by WELLORD1:def 5; :: thesis: verum