reserve L for Boolean non empty RelStr;
reserve a,b,c,d for Element of L;

theorem
  a <= b implies c\b <= c\a
proof
  assume a <= b;
  then 'not' b <= 'not' a by Th37;
  then c"/\"'not' b <= c"/\"'not' a by Th6;
  hence thesis;
end;
