proposition: Lemma set_st_eq : forall A (P Q : A -> Prop), (forall (x:A), P x <-> Q x) -> set_st P = set_st Q.
proof: Proof. Proof using. intros. asserts_rewrite~ (P = Q). extens~. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibList LibOperation LibMonoid LibInt LibNat LibEpsilon LibRelation LibMin)