lean2/tests/lean/rw_set2.lean.expected.out

simplification rules for iff
#2, ?M_1 - ?M_2 ≤ ?M_1 ↦ true
#1, 0 ≤ ?M_1 ↦ true
#1, succ ?M_1 ≤ ?M_1 ↦ false
#1, pred ?M_1 ≤ ?M_1 ↦ true
#1, ?M_1 ≤ succ ?M_1 ↦ true
#2, ?M_1 - ?M_2 < succ ?M_1 ↦ true
#1, ?M_1 < 0 ↦ false
#1, ?M_1 < succ ?M_1 ↦ true
#1, 0 < succ ?M_1 ↦ true
simplification rules for eq
#1, g ?M_1 ↦ f ?M_1 + 1
#2, g ?M_1 ↦ 1
#2, f ?M_1 ↦ 0
#4, ite ?M_1 ?M_4 ?M_4 ↦ ?M_4
#1, 0 - ?M_1 ↦ 0
#2, succ ?M_1 - succ ?M_2 ↦ ?M_1 - ?M_2
refactor(library/simplifier): rename 'rewrite_rule' to 'simp_rule' 2015-07-22 17:39:30 +00:00			`simplification rules for iff`
fix(tests/lean): adjust tests to reflect recent changes in the standard library 2015-07-14 01:46:09 +00:00			`#2, ?M_1 - ?M_2 ≤ ?M_1 ↦ true`
			`#1, 0 ≤ ?M_1 ↦ true`
			`#1, succ ?M_1 ≤ ?M_1 ↦ false`
			`#1, pred ?M_1 ≤ ?M_1 ↦ true`
			`#1, ?M_1 ≤ succ ?M_1 ↦ true`
fix(tests/lean): adjust some tests to changes in the standard library 2015-10-13 23:28:11 +00:00			`#2, ?M_1 - ?M_2 < succ ?M_1 ↦ true`
			`#1, ?M_1 < 0 ↦ false`
			`#1, ?M_1 < succ ?M_1 ↦ true`
			`#1, 0 < succ ?M_1 ↦ true`
refactor(library/simplifier): rename 'rewrite_rule' to 'simp_rule' 2015-07-22 17:39:30 +00:00			`simplification rules for eq`
fix(library/simplifier): bug in is_permutation_ceqv 2015-06-02 01:07:31 +00:00			`#1, g ?M_1 ↦ f ?M_1 + 1`
			`#2, g ?M_1 ↦ 1`
			`#2, f ?M_1 ↦ 0`
fix(tests/lean): adjust some tests to changes in the standard library 2015-10-13 23:28:11 +00:00			`#4, ite ?M_1 ?M_4 ?M_4 ↦ ?M_4`
fix(tests/lean): adjust tests to reflect recent changes in the standard library 2015-07-14 01:46:09 +00:00			`#1, 0 - ?M_1 ↦ 0`
			`#2, succ ?M_1 - succ ?M_2 ↦ ?M_1 - ?M_2`