proposition: Lemma red_rtc_incl_proj_red_rtc : red R # << proj_ord (red R' #).
proof: Proof. unfold inclusion. induction 1. apply incl_proj with (red R' %). apply rc_incl_rtc. apply red_incl_proj_red_rc. exact H. unfold proj_ord. apply rt_refl. unfold proj_ord. apply rt_trans with (proj y). apply IHclos_refl_trans1. apply IHclos_refl_trans2. Qed.
imports: CoLoR(ATrs VecUtil LogicUtil ListUtil SN ARelation RelUtil ACompat NatUtil)