proposition: Lemma max_element_inverse : forall A (le:binary A) (P:A->Prop) (x:A), max_element le P x = min_element (inverse le) P x.
proof: Proof. Proof using. extens. unfold max_element, min_element. rewrite* upper_bound_inverse. Qed.
imports: TLC(LibTactics LibLogic LibReflect LibOperation LibRelation LibOrder LibEpsilon)