Theorems · Definition · order theory
RelEmbedding.swap
{α : Type u_1} → {β : Type u_2} → {r : α → α → Prop} → {s : β → β → Prop} → r ↪r s → Function.swap r ↪r Function.swap sA relation embedding is also a relation embedding between dual relations.
- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- RelEmbeddingstatement and proof · cited by 281
- Function.swapstatement · cited by 216
- RelEmbedding.toEmbeddingproof · cited by 45
- RelEmbedding.map_rel_iffproof · cited by 25
Cited by4
Results whose statement or proof uses this declaration.
- RelEmbedding.natGTproof · cited by 6
- wellFoundedGT_iff_monotone_chain_condition'proof · cited by 3
- wellQuasiOrderedLE_iffproof · cited by 1
- RelEmbedding.swap_applystatement · cited by 0