proposition: Lemma incl_transitive_closure: ∀ (k : nat) (l l' trl : list (graph k)), is_transitive_closure l' trl -> incl l l' -> incl_transitive_closure_of l l' → is_transitive_closure l trl.
proof: Proof. intros. red in H, H0, H1 |- *. intuition. Qed.
imports: Equations(Equations) Examples.Fin Relations Utf8 Relations Wellfounded Setoid RelationClasses Morphisms Lia Bool List Arith String Coq(FunctionalExtensionality) ssreflect