michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix(library/data/nat/basic): simplify two lemmas

Browse source
This commit is contained in:
Leonardo de Moura 2015-10-07 10:32:20 -07:00
parent 3bb09e9959
commit 5f967f40b2
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
library/data/nat/basic.lean
View file

@ -126,7 +126,7 @@ nat.induction_on m
theorem add.comm [simp] (n m : ℕ) : n + m = m + n := theorem add.comm [simp] (n m : ℕ) : n + m = m + n :=
nat.induction_on m nat.induction_on m
(!add_zero ⬝ !zero_add⁻¹) (by rewrite [add_zero, zero_add])
(take k IH, calc (take k IH, calc
n + succ k = succ (n+k) : add_succ n + succ k = succ (n+k) : add_succ
... = succ (k + n) : IH ... = succ (k + n) : IH
@ -137,7 +137,7 @@ theorem succ_add_eq_succ_add (n m : ℕ) : succ n + m = n + succ m :=
theorem add.assoc [simp] (n m k : ℕ) : (n + m) + k = n + (m + k) := theorem add.assoc [simp] (n m k : ℕ) : (n + m) + k = n + (m + k) :=
nat.induction_on k nat.induction_on k
(!add_zero ▸ !add_zero) (by rewrite +add_zero)
(take l IH, (take l IH,
calc calc
(n + m) + succ l = succ ((n + m) + l) : add_succ (n + m) + succ l = succ ((n + m) + l) : add_succ