proposition: Lemma option_Rxx T (rT : T -> T -> Type) l : (forall x, rT x x) -> option_R rT l l.
proof: Proof. by move=> Hr; case: l => *; constructor. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype) Param(Param) ProofIrrelevance