Module TF := TF'.
(* Put the discrete topped order on rhs *)
Inductive le_T : T -> T -> Prop :=
| le_T_refl : forall t1 t2,
t1 == t2 -> le_T t1 t2
| le_T_bot: forall t,
le_T T_bot t.

Lemma le_T_asym: forall t1 t2,
le_T t1 t2 -> le_T t2 t1 -> t1 == t2.