The method of proof by mathematical induction follows from Peano axiom 5. We give three properties which are often used in the proofs by mathematical induction. We show that these are equivalent. Supposing the well-ordering property we prove the validity of this method without using Peano axiom 5. Finally, we introduce the simplest form of recursive definition.