Theorems · Theorem · order theory
WellQuasiOrdered.of_surjective
∀ {α : Type u_3} {β : Type u_4} {r : α → α → Prop} {s : β → β → Prop},
WellQuasiOrdered r → ∀ (f : r →r s), Function.Surjective ⇑f → WellQuasiOrdered s- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Function.surjInvproof · cited by 63
- RelHomstatement and proof · cited by 49
- Function.surjInv_eqproof · cited by 18
- WellQuasiOrderedstatement and proof · cited by 15
- RelHom.map_relproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Monotone.wellQuasiOrderedLE_of_wellQuasiOrderedLE_of_surjectiveproof · cited by 1