proposition: Lemma sep__part_fun_bnd : forall (i : nat) (H : i <= m), sep__part_fun i H <= n.
proof: Proof. intros. unfold sep__part_fun in |- *. elim (le_lt_eq_dec _ _ H); intro; simpl in |- *. apply sep__part_h_bnd. apply le_n. Qed.
imports: CoRN.ftc.COrdLemmas CoRN.ftc.Partitions Coq(Lia)