Theorems · Theorem · order theory
RelIso.map_rel_iff
∀ {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} (f : r ≃r s) {a b : α}, s (f a) (f b) ↔ r a b- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- RelIsostatement and proof · cited by 456
- RelIso.map_rel_iff'proof · cited by 2
Cited by18
Results whose statement or proof uses this declaration.
- OrderIso.le_iff_leproof · cited by 29
- Ordinal.enum_lt_enumproof · cited by 4
- SimpleGraph.Iso.map_adj_iffproof · cited by 2
- RelIso.wellQuasiOrdered_iffproof · cited by 2
- RelIso.rel_symm_applyproof · cited by 2
- QuotientGroup.con_le_iffproof · cited by 1
- AlgebraicGeometry.Scheme.Cover.toPresieveOver_le_arrows_iffproof · cited by 1
- SimpleGraph.Subgraph.map_iso_topproof · cited by 1
- SimpleGraph.isCompleteMultipartite_iffproof · cited by 1
- TwoSidedIdeal.ringCon_le_iffproof · cited by 1
- QuotientAddGroup.con_le_iffproof · cited by 1
- equivShrink_le_equivShrinkproof · cited by 0