Section fun_finite_t_upto.
(* If X is finite and discrete and Y is finite that X -> Y is finite upto extensional equality *)
Variable (X : Type) (HX1 : finite_t X) (HX2 : discrete X)
(Y : Type) (HY : finite_t Y).
Let D : { n : nat & bij_t X (pos n) }.

Theorem fun_finite_t_upto : finite_t_upto (X -> Y) (@fun_ext _ _).