proposition: Lemma LETS_total : eq_midex A -> rel_midex R -> total LETS l.
proof: Proof. unfold LETS, total. intros. pose (R_midex_clos_trans_restriction_midex H H0 l). apply try_add_arc_many_to_many_trichotomy; try hyp. apply restricted_clos_trans. apply restricted_restriction. refl. Qed.
imports: Coq(Sumbool Arith) CoLoR(RelDec RelUtil ListUtil RelSub Path LogicUtil)