Induction proof: Difference between revisions

From Event-B
Jump to navigationJump to search
imported>Mathieu
imported>Mathieu
m wikipedia link
Line 1: Line 1:
This page explains how to prove with induction method on the natural number with Rodin tools.
This page explains how to prove with [[wikipedia:Mathematical induction|induction]] method on the natural number with Rodin tools.
In other words, how to proove :
In other words, how to proove :



Revision as of 14:08, 30 October 2008

This page explains how to prove with induction method on the natural number with Rodin tools. In other words, how to proove :


P(0)

\forall i.i \in \mathbb{N}\land P(i) \Rightarrow P(i+1)

\vdash
\forall i. i \in \mathbb{N}  \Rightarrow P(i)


The proof key is the following theorem:


\forall s.s \subseteq \mathbb{N} \land 0 \in s \land  (\forall n.n \in s \Rightarrow n+1 \in s)\Rightarrow  \mathbb{N} \subseteq s


The proof of the previous theorem is given by instantiating the key theorem with : 	  \{x|x\in \mathbb{N} \land P(x)\}