rewrite < t; reflexivity.
qed.
-theorem test_rewrite_in_hyp: \forall n,m. n + 0 = m \to m = n + 0 \to n=m \land m+0=n+0.
+theorem test_rewrite_in_hyp:
+ \forall n,m. n + 0 = m \to m = n + 0 \to n=m \land m+0=n+0.
intros.
rewrite < plus_n_O in H.
rewrite > plus_n_O in H1.
split; [ exact H | exact H1].
qed.
+
+theorem test_rewrite_in_hyp2:
+ \forall n,m. n + 0 = m \to n + 0 = m \to n=m \land n+0=m.
+ intros.
+ rewrite < plus_n_O in H H1 \vdash (? ? %).
+ split; [ exact H | exact H1].
+qed.