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

fix(real/order): remove sorry

Browse source
This commit is contained in:
Rob Lewis 2015-10-13 16:14:59 -04:00 committed by Leonardo de Moura
parent 06c1a97259
commit 670ac6ae19
1 changed files with 2 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
library/data/real/order.lean
View file

@ -872,18 +872,17 @@ theorem le_of_const_le_const {a b : ℚ} (H : s_le (const a) (const b)) : a ≤
end end
theorem nat_inv_lt_rat {a : ℚ} (H : a > 0) : ∃ n : ℕ+, n⁻¹ < a := theorem nat_inv_lt_rat {a : ℚ} (H : a > 0) : ∃ n : ℕ+, n⁻¹ < a :=
/-begin begin
existsi (pceil (1 / (a / (2)))), existsi (pceil (1 / (a / (2)))),
apply lt_of_le_of_lt, apply lt_of_le_of_lt,
rotate 1, rotate 1,
apply div_two_lt_of_pos H, apply div_two_lt_of_pos H,
rewrite -(one_div_one_div (a / (1 + 1))), rewrite -(one_div_one_div (a / (1 + 1))),
apply pceil_helper, apply pceil_helper,
rewrite one_div_one_div,
apply pnat.le.refl, apply pnat.le.refl,
apply one_div_pos_of_pos, apply one_div_pos_of_pos,
apply div_pos_of_pos_of_pos H dec_trivial apply div_pos_of_pos_of_pos H dec_trivial
end-/sorry end
theorem const_lt_const_of_lt {a b : ℚ} (H : a < b) : s_lt (const a) (const b) := theorem const_lt_const_of_lt {a b : ℚ} (H : a < b) : s_lt (const a) (const b) :=