47 lines
2.6 KiB
Text
47 lines
2.6 KiB
Text
/- This test assumes the total order on terms used by simp compares local constants
|
||
using the order they appear in the local context. -/
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
example (m : ℕ) : ∀ n k, m + n = k → n + m = k := by intros; simp; assumption
|
||
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|
||
|
||
example (m : ℕ) : ∀ n k, n + m = k → n + m = k :=
|
||
begin intros, simp, fail_if_success {assumption}, admit end
|