reserve G for _Graph;
reserve V for non empty set, E for Relation of V;
reserve E for symmetric Relation of V;
reserve G for GraphFromSymRel of V, E;

theorem
  E is total reflexive iff G is loopfull
proof
  thus E is total reflexive implies G is loopfull;
  assume G is loopfull;
  then createGraph(V,E) is loopfull;
  hence E is total reflexive by Th71;
end;
