case n.
left;trivial.
intros.
right.
destruct m.
rewrite mult_comm in H.
discriminate.
destruct m;trivial.
assert ((S n0)<(S n0)*(S (S m))).
apply mult_lemma3;intros;auto with arith.
rewrite <- H in H0.
elim (lt_irrefl (S n0) H0).
Qed.

(* Specifications: *)
Lemma mult_lemma5 : forall (n m:nat),((n * m) =1)->(n=1)/\(m=1).
induction n;simpl;intros;try discriminate.