Theorem with_top.not_top_le_coe
Modification history
2022-11-27 23:52
src/order/bounded_order.lean
chore(order/bounded_order): split (#17730) …
Modified with_top.not_top_le_coeView on Github →2022-06-04 13:17
src/order/bounded_order.lean
chore(order/bounded_order): move `order_dual` instances up, use them to golf lemmas (#14544) …
Modified with_top.not_top_le_coeView on Github →2022-04-16 17:33
src/order/bounded_order.lean
chore(order/bounded_order): Match the `with_bot` and `with_top` API (#13419) …
Modified with_top.not_top_le_coeView on Github →2022-04-04 16:21
src/order/bounded_order.lean
refactor(order/succ_order/basic): Use `is_min`/`is_max` (#12597) …
Modified with_top.not_top_le_coeView on Github →