proposition: Theorem _paco0_mult_strong: forall r, paco0 gf (upaco0 gf r) <0== paco0 gf r.
proof: Proof. intros. apply curry_map0. eapply le1_trans; [| eapply _paco_mult_strong]. apply _paco_mon; intros [] H; apply H. Qed.
imports: Program.Basics Paco(paconotation_internal paco_internal pacotac_internal)