proposition: Lemma LETS_midex : eq_midex A -> rel_midex R -> rel_midex LETS.
proof: Proof. intros. unfold LETS. apply try_add_arc_many_to_many_midex. hyp. refl. apply restricted_clos_trans. apply restricted_restriction. apply R_midex_clos_trans_restriction_midex; hyp. Qed.
imports: Coq(Sumbool Arith) CoLoR(RelDec RelUtil ListUtil RelSub Path LogicUtil)