set I = the InternalRel of R;
A1: the InternalRel of R is_reflexive_in {}
proof
let x be object ; :: according to RELAT_2:def 1 :: thesis: ( not x in {} or [x,x] in the InternalRel of R )
thus ( not x in {} or [x,x] in the InternalRel of R ) ; :: thesis: verum
end;
A2: the InternalRel of R is_transitive_in {}
proof
let x, y, z be object ; :: according to RELAT_2:def 8 :: thesis: ( not x in {} or not y in {} or not z in {} or not [x,y] in the InternalRel of R or not [y,z] in the InternalRel of R or [x,z] in the InternalRel of R )
thus ( not x in {} or not y in {} or not z in {} or not [x,y] in the InternalRel of R or not [y,z] in the InternalRel of R or [x,z] in the InternalRel of R ) ; :: thesis: verum
end;
A3: the InternalRel of R is_antisymmetric_in {}
proof
let x, y be object ; :: according to RELAT_2:def 4 :: thesis: ( not x in {} or not y in {} or not [x,y] in the InternalRel of R or not [y,x] in the InternalRel of R or x = y )
thus ( not x in {} or not y in {} or not [x,y] in the InternalRel of R or not [y,x] in the InternalRel of R or x = y ) ; :: thesis: verum
end;
A4: the InternalRel of R is_connected_in {}
proof
let x, y be object ; :: according to RELAT_2:def 6 :: thesis: ( not x in {} or not y in {} or x = y or [x,y] in the InternalRel of R or [y,x] in the InternalRel of R )
thus ( not x in {} or not y in {} or x = y or [x,y] in the InternalRel of R or [y,x] in the InternalRel of R ) ; :: thesis: verum
end;
{} R is well_founded by Th11;
hence {} R is well-ordering by A1, A2, A3, A4, WELLORD1:def 5, WELLFND1:def 3; :: thesis: verum