lean2/tests/lean/run/blast_cc12.lean

set_option blast.strategy "simple"

definition foo1 (a b : nat) (p : Prop) : a = b → (b = a → p) → p :=
by blast

print foo1

definition foo2 (a b c : nat) (p : Prop) : a = b → b = c → (c = a → p) → p :=
by blast

print foo2

definition foo3 (a b c d : nat) (p : Prop) : a ≠ d → (d ≠ a → p) → p :=
by blast

print foo3

attribute not [reducible]

definition foo4 (a b c d : nat) (p : Prop) : a ≠ d → (d ≠ a → p) → p :=
by blast

attribute ne [semireducible]

definition foo5 (a b c d : nat) (p : Prop) : a ≠ d → (d ≠ a → p) → p :=
by blast

print foo5
feat(library/blast/strategies): add strategy for testing congruence closure module 2015-12-06 22:33:21 +00:00			`set_option blast.strategy "simple"`
feat(library/blast/congruence_closure): add support for propagating units in the congruence closure module See blast_cc12.lean for example. 2015-11-22 23:39:44 +00:00
			`definition foo1 (a b : nat) (p : Prop) : a = b → (b = a → p) → p :=`
			`by blast`

			`print foo1`

			`definition foo2 (a b c : nat) (p : Prop) : a = b → b = c → (c = a → p) → p :=`
			`by blast`

			`print foo2`
feat(library/app_builder): avoid redundant proof terms at mk_of_iff_true and mk_not_of_iff_false 2015-11-22 23:49:17 +00:00
			`definition foo3 (a b c d : nat) (p : Prop) : a ≠ d → (d ≠ a → p) → p :=`
			`by blast`

			`print foo3`
feat(library/blast/unit/unit_propagate): make sure unif_propagate works even if 'not' is marked as '[reducible]' 2015-12-05 00:49:21 +00:00
			`attribute not [reducible]`

			`definition foo4 (a b c d : nat) (p : Prop) : a ≠ d → (d ≠ a → p) → p :=`
			`by blast`

feat(library/blast/blast): force 'ne' to be always transparent 2015-12-05 01:58:39 +00:00			`attribute ne [semireducible]`

			`definition foo5 (a b c d : nat) (p : Prop) : a ≠ d → (d ≠ a → p) → p :=`
			`by blast`

			`print foo5`