Theorems · Definition · order theory
Int.ceil
{α : Type u_2} → [inst : Ring α] → [inst_1 : LinearOrder α] → [FloorRing α] → α → ℤInt.ceil a is the smallest integer z such that a ≤ z. It is denoted with ⌈a⌉.
- Defined in
- Mathlib.Algebra.Order.Floor.Defs
- Cited by
- 138 results in Mathlib
- Foundations
- Depth 3 from the axioms, rests on 6 definitions · uses no axioms
- Assumes
- RingLinearOrderFloorRing
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.
- LinearOrderstatement and proof · cited by 8,572
- Ringstatement and proof · cited by 7,463
- FloorRingstatement and proof · cited by 405
- FloorRing.ceilproof · cited by 3
Cited by142
Results whose statement or proof uses this declaration.
- roundproof · cited by 49
- Int.ceil_lestatement · cited by 17
- Int.le_ceilstatement · cited by 13
- Int.ceil_intCaststatement · cited by 11
- BoxIntegral.unitPartition.indexproof · cited by 10
- Int.ceil_add_intCaststatement and proof · cited by 8
- Int.ceil_eq_iffstatement and proof · cited by 8
- Int.ceil_lt_add_onestatement and proof · cited by 7
- Int.lt_ceilstatement · cited by 6
- Int.ceil_monostatement · cited by 5
- beattySeq'proof · cited by 5
- ProbabilityTheory.Kernel.HasSubgaussianMGF.ae_forall_integrable_exp_mulproof · cited by 4