proposition: Lemma or_pred_prop' r x y: total_order r -> consecutive r x y -> x = or_pred r y.
proof: Proof. move => pa pb; apply:(conseq_unique_left pa pb); apply: (or_pred_prop pa). by exists x. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)