(* Check that problems with several solutions are solved in 8.4 as in 8.2 and 8.3 *)
Inductive Fin: nat -> Set :=
| first k : Fin (S k)
| succ k: Fin k -> Fin (S k).

Lemma match_sym_eq_eq: forall (n1 n2: nat)(f: Fin n1)(e: n1 = n2),
f = match sym_eq e in (_ = l) return (Fin l) with refl_equal =>
match e in (_ = l) return (Fin l) with refl_equal => f end end.