Induction proof: Difference between revisions
From Event-B
Jump to navigationJump to search
imported>Christophe No edit summary |
imported>Christophe No edit summary |
||
Line 16: | Line 16: | ||
The proof key is the following theorem:<br/> | The proof key is the following theorem:<br/> | ||
<math> | <math> | ||
\forall s.s \subseteq \mathbb{N} \land 0 \in s \land (\forall n.n \in s \Rightarrow n+1 \in s)\Rightarrow N \subseteq s | \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 | ||
</math> | </math> | ||
Revision as of 21:27, 13 October 2008
This page explains how to proove with induction method on the natural number with Rodin tools.
In other words, how to proove :
The proof key is the following theorem:
The proof of the previous theorem is given by instanciate the key theorem with :