Theorems · Theorem · order theory
Nat.sInf_upward_closed_eq_succ_iff
∀ {s : Set ℕ}, (∀ (k₁ k₂ : ℕ), k₁ ≤ k₂ → k₁ ∈ s → k₂ ∈ s) → ∀ (k : ℕ), sInf s = k + 1 ↔ k + 1 ∈ s ∧ k ∉ s- Defined in
- Mathlib.Order.Lattice.Nat
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- le_rflproof · cited by 1,558
- Set.Iciproof · cited by 1,070
- InfSet.sInfstatement and proof · cited by 935
- Set.mem_Iciproof · cited by 37
- Nat.sInf_defproof · cited by 13
- Nat.find_eq_iffproof · cited by 6
- Nat.eq_Ici_of_nonempty_of_upward_closedproof · cited by 1
- Nat.nonempty_of_sInf_eq_succproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- LieModule.nilpotencyLength_eq_succ_iffproof · cited by 3
- LieAlgebra.derivedSeries_of_derivedLength_succproof · cited by 2
- nilpotencyClass_eq_succ_iffproof · cited by 2