Theorems · Theorem · order theory
Set.isWF_iff_no_descending_seq
∀ {α : Type u_2} [inst : Preorder α] {s : Set α}, s.IsWF ↔ ∀ (f : ℕ → α), StrictAnti f → ¬∀ (n : ℕ), f n ∈ s- Defined in
- Mathlib.Order.WellFoundedSet
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 31 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- RelEmbeddingproof · cited by 281
- StrictAntistatement and proof · cited by 204
- Set.IsWFstatement · cited by 47
- RelEmbedding.map_rel_iffproof · cited by 25
- StrictAnti.injectiveproof · cited by 12
- StrictAnti.lt_iff_gtproof · cited by 10
- Set.wellFoundedOn_iff_no_descending_seqproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- HahnEmbedding.Partial.isWF_support_evalCoeffproof · cited by 0