proposition: Lemma prop3_incl A B C D (f : A -> B -> C -> D) : Proper (incl --> incl --> incl --> incl ==> impl) (fun R S T V => Proper (R ==> S ==> T ==> V) f).
proof: Proof. intros R R' RR' S S' SS' T T' TT' V V' VV' hf x x' xx' y y' yy' z z' zz'. apply VV'. apply hf; fo. Qed.
imports: Coq(Setoid Basics Morphisms List Lia) CoLoR(LogicUtil)