Theorems · Theorem · order theory
Set.partiallyWellOrderedOn_iff_finite_antichains
∀ {α : Type u_2} {r : α → α → Prop} {s : Set α} [Std.Refl r] [Std.Symm r],
s.PartiallyWellOrderedOn r ↔ ∀ t ⊆ s, IsAntichain r t → t.Finite- Defined in
- Mathlib.Order.WellFoundedSet
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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
- Set.rangeproof · cited by 4,705
- Set.Finitestatement and proof · cited by 1,814
- lt_trichotomyproof · cited by 178
- Ne.lt_or_gtproof · cited by 108
- IsAntichainstatement and proof · cited by 105
- Set.range_subset_iffproof · cited by 99
- reflproof · cited by 80
- symmproof · cited by 48
- Set.PartiallyWellOrderedOnstatement and proof · cited by 34
- Set.infinite_range_of_injectiveproof · cited by 9
- IsAntichain.finite_of_partiallyWellOrderedOnproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.