proposition: Lemma upper_bound_inverse : forall A (le:binary A), upper_bound le = lower_bound (inverse le).
proof: Proof. Proof using. extens. intros P x. unfolds lower_bound, upper_bound. iff*. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOperation LibRelation LibOrder LibEpsilon)