proposition: Lemma SN_RoF : forall b, SN R b -> forall a, F a b -> SN RoF a.
proof: Proof. induction 1. rename x into b. intros a H1. apply SN_intro. intros a' H2. destruct H2 as [b']. destruct H2. apply (H0 b'). apply H3. hyp. hyp. Qed.
imports: Coq(Morphisms List Basics Lia Wellfounded) CoLoR(LogicUtil RelUtil)