Theorems · Theorem · order theory
Nat.sInf_le
∀ {s : Set ℕ} {m : ℕ}, m ∈ s → sInf s ≤ m- Defined in
- Mathlib.Order.Lattice.Nat
- Cited by
- 20 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- InfSet.sInfstatement · cited by 935
- Nat.find_min'proof · cited by 28
- Nat.sInf_defproof · cited by 13
Cited by20
Results whose statement or proof uses this declaration.
- SimpleGraph.dist_leproof · cited by 5
- DirichletCharacter.conductor_oneproof · cited by 3
- Int.absNorm_under_eq_sInfproof · cited by 2
- MeasureTheory.Measure.haar.index_union_leproof · cited by 2
- MeasureTheory.Measure.haar.addIndex_union_leproof · cited by 2
- DirichletCharacter.conductor_dvd_of_mem_conductorSetproof · cited by 2
- Module.End.maxUnifEigenspaceIndex_le_finrankproof · cited by 1
- Rat.AbsoluteValue.exists_minimal_nat_zero_lt_and_lt_oneproof · cited by 1
- Nat.eq_Ici_of_nonempty_of_upward_closedproof · cited by 1
- gaussSum_eq_zero_of_isPrimitive_of_not_isPrimitiveproof · cited by 1
- MeasureTheory.Measure.haar.index_monoproof · cited by 1
- MeasureTheory.Measure.haar.index_union_eqproof · cited by 1