Theorems · Inductive type · order theory
FloorSemiring
(α : Type u_4) → [Semiring α] → [PartialOrder α] → Type u_4
A FloorSemiring is an ordered semiring over α with a function
floor : α → ℕ satisfying ∀ (n : ℕ) (x : α), n ≤ ⌊x⌋ ↔ (n : α) ≤ x).
Note that many lemmas require a LinearOrder. Please see the above TODO.
- Defined in
- Mathlib.Algebra.Order.Floor.Defs
- Cited by
- 179 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 3 definitions · uses no axioms
- Assumes
- SemiringPartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Semiringstatement · cited by 13,802
- PartialOrderstatement · cited by 6,410
Cited by193
Results whose statement or proof uses this declaration.
- Nat.floorstatement and proof · cited by 215
- Nat.ceilstatement and proof · cited by 141
- Nat.le_ceilstatement and proof · cited by 38
- Int.logstatement and proof · cited by 25
- Nat.le_floor_iffstatement and proof · cited by 24
- Int.clogstatement and proof · cited by 21
- Nat.floor_lestatement and proof · cited by 21
- Nat.floor_natCaststatement and proof · cited by 19
- Nat.lt_floor_add_onestatement and proof · cited by 16
- Nat.ceil_lestatement and proof · cited by 15
- Nat.le_floorstatement and proof · cited by 11
- Nat.ceil_lt_add_onestatement and proof · cited by 11