proposition: Lemma rclo2_dist clo (MON: monotone2 clo) (DIST: forall r1 r2, clo (r1 \2/ r2) <2= (clo r1 \2/ clo r2)): forall r1 r2, rclo2 clo (r1 \2/ r2) <2= (rclo2 clo r1 \2/ rclo2 clo r2).
proof: Proof. intros. induction PR. + destruct IN; [left|right]; apply rclo2_base, H. + assert (REL: clo (rclo2 clo r1 \2/ rclo2 clo r2) x0 x1). { eapply MON. apply IN. apply H. } apply DIST in REL. destruct REL; [left|right]; apply rclo2_clo, H0. Qed.
imports: Program.Basics Paco(paco2 pacotac)