blob: 320b4b53beeffb176354b93d694585f3a1de8f01 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
import Lean
import Mathlib.Tactic.Linarith -- Introduces a lot of useful lemmas
namespace Arith
open Lean Elab Term Meta
-- We can't define and use trace classes in the same file
initialize registerTraceClass `Arith
-- TODO: move?
theorem ne_zero_is_lt_or_gt {x : Int} (hne : x ≠ 0) : x < 0 ∨ x > 0 := by
cases h: x <;> simp_all
. rename_i n;
cases n <;> simp_all
. apply Int.negSucc_lt_zero
-- TODO: move?
theorem ne_is_lt_or_gt {x y : Int} (hne : x ≠ y) : x < y ∨ x > y := by
have hne : x - y ≠ 0 := by
simp
intro h
have: x = y := by omega
simp_all
have h := ne_zero_is_lt_or_gt hne
match h with
| .inl _ => left; omega
| .inr _ => right; omega
-- TODO: move?
theorem add_one_le_iff_le_ne (n m : Nat) (h1 : m ≤ n) (h2 : m ≠ n) : m + 1 ≤ n := by
-- Damn, those proofs on natural numbers are hard - I wish Omega was in mathlib4...
simp [Nat.add_one_le_iff]
simp [Nat.lt_iff_le_and_ne]
simp_all
/- Induction over positive integers -/
-- TODO: move
theorem int_pos_ind (p : Int → Prop) :
(zero:p 0) → (pos:∀ i, 0 ≤ i → p i → p (i + 1)) → ∀ i, 0 ≤ i → p i := by
intro h0 hr i hpos
-- have heq : Int.toNat i = i := by
-- cases i <;> simp_all
have ⟨ n, heq ⟩ : {n:Nat // n = i } := ⟨ Int.toNat i, by cases i <;> simp_all ⟩
revert i
induction n
. intro i hpos heq
cases i <;> simp_all
. rename_i n hi
intro i hpos heq
cases i <;> simp_all
rename_i m
cases m <;> simp_all
-- This is mostly used in termination proofs
theorem to_int_to_nat_lt (x y : ℤ) (h0 : 0 ≤ x) (h1 : x < y) :
↑(x.toNat) < y := by
simp [*]
-- This is mostly used in termination proofs
theorem to_int_sub_to_nat_lt (x y : ℤ) (x' : ℕ)
(h0 : ↑x' ≤ x) (h1 : x - ↑x' < y) :
↑(x.toNat - x') < y := by
have : 0 ≤ x := by omega
simp [Int.toNat_sub_of_le, *]
-- WARNING: do not use this with `simp` as it might loop. The left-hand side indeed reduces to the
-- righ-hand side, meaning the rewriting can be applied to `n` itself.
theorem ofNat_instOfNatNat_eq (n : Nat) : @OfNat.ofNat Nat n (instOfNatNat n) = n := by rfl
end Arith
|
