Theorems · Theorem · order theory
Set.wellFoundedOn_union
∀ {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s t : Set α},
(s ∪ t).WellFoundedOn r ↔ s.WellFoundedOn r ∧ t.WellFoundedOn r- Defined in
- Mathlib.Order.WellFoundedSet
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsStrictOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.subset_union_leftproof · cited by 142
- Set.subset_union_rightproof · cited by 123
- Set.WellFoundedOnstatement and proof · cited by 53
- IsStrictOrderstatement and proof · cited by 28
- Set.WellFoundedOn.subsetproof · cited by 3
- Set.WellFoundedOn.unionproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Set.isWF_unionproof · cited by 0