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

feat(library/algebra/ordered_ring): remove sorry

Browse source
This commit is contained in:
Leonardo de Moura 2015-03-30 11:01:26 -07:00
parent 3d4a02089a
commit 56af7ba535
1 changed files with 22 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

24
library/algebra/ordered_ring.lean
View file

@ -481,8 +481,28 @@ section
... = -(-1) : by rewrite neg_neg ... = -(-1) : by rewrite neg_neg
... = -(sign a) : sign_of_neg H1) ... = -(sign a) : sign_of_neg H1)
-- hopefully, will be quick with the simplifier theorem sign_mul (a b : A) : sign (a * b) = sign a * sign b :=
theorem sign_mul (a b : A) : sign (a * b) = sign a * sign b := sorry lt.by_cases
(assume z_lt_a : 0 < a,
lt.by_cases
(assume z_lt_b : 0 < b,
by rewrite [sign_of_pos z_lt_a, sign_of_pos z_lt_b,
sign_of_pos (mul_pos z_lt_a z_lt_b), one_mul])
(assume z_eq_b : 0 = b, by rewrite [-z_eq_b, mul_zero, *sign_zero, mul_zero])
(assume z_gt_b : 0 > b,
by rewrite [sign_of_pos z_lt_a, sign_of_neg z_gt_b,
sign_of_neg (mul_neg_of_pos_of_neg z_lt_a z_gt_b), one_mul]))
(assume z_eq_a : 0 = a, by rewrite [-z_eq_a, zero_mul, *sign_zero, zero_mul])
(assume z_gt_a : 0 > a,
lt.by_cases
(assume z_lt_b : 0 < b,
by rewrite [sign_of_neg z_gt_a, sign_of_pos z_lt_b,
sign_of_neg (mul_neg_of_neg_of_pos z_gt_a z_lt_b), mul_one])
(assume z_eq_b : 0 = b, by rewrite [-z_eq_b, mul_zero, *sign_zero, mul_zero])
(assume z_gt_b : 0 > b,
by rewrite [sign_of_neg z_gt_a, sign_of_neg z_gt_b,
sign_of_pos (mul_pos_of_neg_of_neg z_gt_a z_gt_b),
neg_mul_neg, one_mul]))
theorem abs_eq_sign_mul (a : A) : abs a = sign a * a := theorem abs_eq_sign_mul (a : A) : abs a = sign a * a :=
lt.by_cases lt.by_cases