Module M.
Function test_m (n:nat) : nat :=
match n with
| 0 => 0
| S n =>  S (S (test_m n))
end.
End M.
(* We redefine a new Function with the same name *)
Function test_m (n:nat) : nat :=
pred n.

(* Checks if the dot notation are correctly treated in infos *)
Lemma M_test_m_is_double : forall n, div2 (M.test_m n) = n.