michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix(doc/lean/tutorial): typos

Browse source 
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
Leonardo de Moura 2014-08-25 11:22:15 -07:00
parent 2c35696fed
commit 800d3bd70a
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
doc/lean/tutorial.org
View file

@ -441,7 +441,7 @@ Lean. The theorems can be broken into three different categories:
introduction, elimination, and rewriting. First, we cover the introduction introduction, elimination, and rewriting. First, we cover the introduction
and elimination theorems for the basic Boolean connectives. and elimination theorems for the basic Boolean connectives.
*** And (conjuction) *** And (conjunction)
The expression =and_intro H1 H2= creates a proof for =a ∧ b= using proofs The expression =and_intro H1 H2= creates a proof for =a ∧ b= using proofs
=H1 : a= and =H2 : b=. We say =and_intro= is the _and-introduction_ operation. =H1 : a= and =H2 : b=. We say =and_intro= is the _and-introduction_ operation.
@ -477,7 +477,7 @@ Now, we prove =p ∧ q → q ∧ p= with the following simple proof term.
Note that the proof term is very similar to a function that just swaps the Note that the proof term is very similar to a function that just swaps the
elements of a pair. elements of a pair.
*** (disjuction) *** (disjunction)
The expression =or_intro_left b H1= creates a proof for =a ∨ b= using a proof =H1 : a=. The expression =or_intro_left b H1= creates a proof for =a ∨ b= using a proof =H1 : a=.
Similarly, =or_intro_right a H2= creates a proof for =a ∨ b= using a proof =H2 : b=. Similarly, =or_intro_right a H2= creates a proof for =a ∨ b= using a proof =H2 : b=.