Theorems · Theorem · order theory
Set.PartiallyWellOrderedOn.union
∀ {α : Type u_2} {r : α → α → Prop} {s t : Set α},
s.PartiallyWellOrderedOn r → t.PartiallyWellOrderedOn r → (s ∪ t).PartiallyWellOrderedOn r- Defined in
- Mathlib.Order.WellFoundedSet
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- OrderEmbeddingproof · cited by 619
- Set.PartiallyWellOrderedOnstatement and proof · cited by 34
- OrderEmbedding.strictMonoproof · cited by 26
- Set.PartiallyWellOrderedOn.exists_ltproof · cited by 3
- Nat.exists_subseq_of_forall_mem_unionproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Set.IsPWO.unionproof · cited by 2
- Set.partiallyWellOrderedOn_unionproof · cited by 1