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

chore(library/standard/data/nat/div): remove TODO

Browse source 
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
Leonardo de Moura 2014-08-21 17:58:03 -07:00
parent 6cf73b51e2
commit 0df87bae24
1 changed files with 1 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
library/standard/data/nat/div.lean
View file

@ -663,9 +663,7 @@ have aux : ∀m, P m n, from
aux m
theorem gcd_succ (m n : ℕ) : gcd m (succ n) = gcd (succ n) (m mod succ n) :=
-- TODO: note, fails if "succ n" is not given explicitly
-- remember that if_neg needs to infer "decidable" for n ~= 0
trans (gcd_def _ (succ n)) (if_neg (succ_ne_zero n) _ _)
trans (gcd_def _ _) (if_neg (succ_ne_zero n) _ _)
theorem gcd_one (n : ℕ) : gcd n 1 = 1 := sorry
-- (by simp) (gcd_succ n 0)