proposition: Lemma sep__part_fun_i : forall (i : nat) (H : i <= m), i < m -> sep__part_fun i H = sep__part_h i.
proof: Proof. intros. unfold sep__part_fun in |- *. elim (le_lt_eq_dec _ _ H); intro; simpl in |- *. reflexivity. rewrite b0 in H0; elim (Nat.lt_irrefl _ H0). Qed.
imports: CoRN.ftc.COrdLemmas CoRN.ftc.Partitions Coq(Lia)