lean2/tests/lean/tst11.lean

Definition xor (x y : Bool) : Bool := (not x) = y
Infixr 50 ⊕ : xor
print xor true false
Eval xor true true
Eval xor true false
Variable a : Bool
print a ⊕ a ⊕ a
Check @Subst
Theorem EM2 (a : Bool) : a \/ (not a) :=
   Case (fun x : Bool, x \/ (not x)) Trivial Trivial a
Check EM2
Check EM2 a
Add parse_theorem and parse_definition Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2013-08-18 19:48:02 +00:00			`Definition xor (x y : Bool) : Bool := (not x) = y`
Allow notation to be associated with arbitrary expression (instead of only constants). Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2013-08-20 00:25:15 +00:00			`Infixr 50 ⊕ : xor`
feat(frontends/lean/parser): combine Echo and Show commands into the 'print' command Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-01-05 19:03:35 +00:00			`print xor true false`
Add parse_theorem and parse_definition Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2013-08-18 19:48:02 +00:00			`Eval xor true true`
			`Eval xor true false`
			`Variable a : Bool`
feat(frontends/lean/parser): combine Echo and Show commands into the 'print' command Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-01-05 19:03:35 +00:00			`print a ⊕ a ⊕ a`
feat(frontends/lean): simplify explicit version names Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2013-12-22 01:02:16 +00:00			`Check @Subst`
Add parse_theorem and parse_definition Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2013-08-18 19:48:02 +00:00			`Theorem EM2 (a : Bool) : a \/ (not a) :=`
			`Case (fun x : Bool, x \/ (not x)) Trivial Trivial a`
			`Check EM2`
			`Check EM2 a`