Theorems · Definition · order theory
Nat.ceil
{α : Type u_2} → [inst : Semiring α] → [inst_1 : PartialOrder α] → [FloorSemiring α] → α → ℕ⌈a⌉₊ is the least natural n such that a ≤ n
- Defined in
- Mathlib.Algebra.Order.Floor.Defs
- Cited by
- 141 results in Mathlib
- Foundations
- Depth 3 from the axioms, rests on 6 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Semiringstatement and proof · cited by 13,802
- PartialOrderstatement and proof · cited by 6,410
- FloorSemiringstatement and proof · cited by 179
- FloorSemiring.ceilproof · cited by 2
Cited by149
Results whose statement or proof uses this declaration.
- ENat.ceilproof · cited by 41
- Nat.le_ceilstatement · cited by 38
- Int.logproof · cited by 25
- Int.clogproof · cited by 21
- Nat.ceil_lestatement · cited by 15
- Nat.ceil_lt_add_onestatement and proof · cited by 11
- Nat.lt_ceilstatement · cited by 10
- Int.log_of_right_le_onestatement and proof · cited by 8
- SimpleGraph.triangleRemovalBoundproof · cited by 7
- Behrend.nValueproof · cited by 6
- Nat.ceil_eq_zerostatement · cited by 6
- Nat.ceil_natCaststatement · cited by 6