right.apply not_eq_pp_nn.
right.apply not_eq_pp_cons.
intros. elim g1.
- right.intro.apply not_eq_pp_nn n1 n ?.apply sym_eq. assumption.
+ right.intro.apply not_eq_pp_nn n1 n.apply sym_eq. assumption.
elim ((decidable_eq_nat n n1) : Or (n=n1) (n=n1 \to False)).
left. apply eq_f. assumption.
right.intro.apply H.apply injective_nn.assumption.
right.apply not_eq_nn_cons.
- intros.right.intro.apply not_eq_pp_cons m x f1 ?.apply sym_eq.assumption.
- intros.right.intro.apply not_eq_nn_cons m x f1 ?.apply sym_eq.assumption.
+ intros.right.intro.apply not_eq_pp_cons m x f1.apply sym_eq.assumption.
+ intros.right.intro.apply not_eq_nn_cons m x f1.apply sym_eq.assumption.
intros.elim H.
elim ((decidable_eq_Z x y) : Or (x=y) (x=y \to False)).
left.apply eq_f2.assumption.
simplify.apply not_eq_pp_nn.
simplify.apply not_eq_pp_cons.
intros.elim g1.
- simplify.intro.apply not_eq_pp_nn n1 n ?.apply sym_eq. assumption.
+ simplify.intro.apply not_eq_pp_nn n1 n.apply sym_eq. assumption.
simplify.apply eqb_elim.intro.simplify.apply eq_f.assumption.
intro.simplify.intro.apply H.apply injective_nn.assumption.
simplify.apply not_eq_nn_cons.
- intros.simplify.intro.apply not_eq_pp_cons m x f1 ?.apply sym_eq. assumption.
- intros.simplify.intro.apply not_eq_nn_cons m x f1 ?.apply sym_eq. assumption.
+ intros.simplify.intro.apply not_eq_pp_cons m x f1.apply sym_eq. assumption.
+ intros.simplify.intro.apply not_eq_nn_cons m x f1.apply sym_eq. assumption.
intros.
change in match (eqfb (cons x f1) (cons y g1))
with (andb (eqZb x y) (eqfb f1 g1)).
intro.elim r.
reflexivity.
simplify.apply ftimes_finv.
-qed.
\ No newline at end of file
+qed.