proposition: Lemma functional_eq_seq_inverse_incl_eq : forall A (R:binary A), functional R = rel_incl (rel_seq (inverse R) R) eq.
proof: Proof. Proof using. unfold functional, rel_incl, rel_seq, inverse. extens. iff M; jauto. Qed.
imports: TLC(LibTactics LibLogic LibBool LibLogic LibProd LibSum)