lean2/tests/lean/run/tactic13.lean

import logic
open tactic

theorem tst (a b : Prop) (H : ¬ a ∨ ¬ b) (Hb : b) : ¬ a ∧ b :=
begin
  apply and.intro,
  assumption,
  apply not_intro,
  assume Ha, or.elim H
    (assume Hna, @absurd _ false Ha Hna)
    (assume Hnb, @absurd _ false Hb Hnb)
end
-												chore(*): minimize dependencies on tests

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-08-25 02:58:48 +00:00
+								import logic
-												feat(frontends/lean): rename 'using' command to 'open'

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-09-03 23:00:38 +00:00
+								open tactic
-												feat(frontends/lean): add 'proof-qed' notation

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-03 02:30:48 +00:00
-												refactor(*): rename Bool to Prop

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-22 16:43:18 +00:00
+								theorem tst (a b : Prop) (H : ¬ a ∨ ¬ b) (Hb : b) : ¬ a ∧ b :=
-												feat(frontends/lean): use 'begin-end' instead of 'proof-qed' for blocks of tactics, closes #81

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-08-21 17:36:44 +00:00
+								begin
-												feat(frontends/lean/inductive_cmd): prefix introduction rules with the name of the inductive datatype

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-09-04 23:36:06 +00:00
+								  apply and.intro,
-												refactor(library/tactic): elaborate expressions nested in tactics with respect to current goal, save postponed constraints (e.g., flex-flex constraints) closes #44, fixes #70

											
										
										
											2014-10-15 00:12:57 +00:00
+								  assumption,
-												feat(frontends/lean): add 'proof-qed' notation

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-07-03 02:30:48 +00:00
+								  apply not_intro,
-												refactor(library): add namespaces 'or', 'and' and 'iff'

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-09-05 04:25:21 +00:00
+								  assume Ha, or.elim H
-												refactor(library/logic/basic): rename absurd_elim to absurd, delete contrapos and trivial_not_true theorems

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-08-28 01:34:09 +00:00
+								    (assume Hna, @absurd _ false Ha Hna)
-												refactor(library/tactic): elaborate expressions nested in tactics with respect to current goal, save postponed constraints (e.g., flex-flex constraints) closes #44, fixes #70

											
										
										
											2014-10-15 00:12:57 +00:00
+								    (assume Hnb, @absurd _ false Hb Hnb)
-												refactor(library/logic/basic): rename absurd_elim to absurd, delete contrapos and trivial_not_true theorems

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

											
										
										
											2014-08-28 01:34:09 +00:00
+								end