proposition: Lemma pacobot2 (T0 : Type) (T1 : T0 -> Type) (gf : rel2 T0 T1 -> rel2 T0 T1) (r : rel2 T0 T1) : paco2 gf bot2 <2= paco2 gf r.
proof: Proof. intros x0 x1 H. eapply (paco2_mon _ H); contradiction. Qed.
imports: Paco(paco)