
theorem Th5:
  for L being non empty reflexive RelStr, c being closure Function
  of L,L for x being Element of L holds c.x >= x
proof
  let L be non empty reflexive RelStr, c be closure Function of L,L;
  let x be Element of L;
  c >= id L by WAYBEL_1:def 14;
  then c.x >= (id L).x by YELLOW_2:9;
  hence thesis;
end;
