--- /dev/null
+inductive nat : Set \def
+ O : nat
+ | S : nat \to nat.
+
+inductive le (n:nat) : nat \to Prop \def
+ leO : le n n
+ | leS : \forall m. le n m \to le n (S m).
+
+alias symbol "eq" (instance 0) = "leibnitz's equality".
+
+theorem test_inversion: \forall n. le n O \to n=O.
+ intros.
+ cut O=O.
+ (* goal 2: 0 = 0 *)
+ goal 7. reflexivity.
+ (* goal 1 *)
+ generalize Hcut. (* non attaccata. Dovrebbe dare 0=0 -> n=0 *)
+ apply (le_ind ? (\lambda x. O=x \to n=x) ? ? ? H).
+ intro. reflexivity.
+ simplify. intros.
+ (* manca discriminate H3 *)
+qed.
\ No newline at end of file