let X be set ; :: thesis: for A being Ordinal st X c= A holds
order_type_of (RelIncl X) c= A

let A be Ordinal; :: thesis: ( X c= A implies order_type_of (RelIncl X) c= A )
assume A1: X c= A ; :: thesis: order_type_of (RelIncl X) c= A
then A2: (RelIncl A) |_2 X = RelIncl X by Th8;
A3: RelIncl X is well-ordering by A1, Th9;
A4: now end;
A5: now end;
field (RelIncl A) = A by Def1;
hence order_type_of (RelIncl X) c= A by A1, A4, A5, Th7, WELLORD1:53; :: thesis: verum