Theorems · Definition
EquivLike.inv
{E : Sort u_1} → {α : outParam (Sort u_2)} → {β : outParam (Sort u_3)} → [self : EquivLike E α β] → E → β → αThe coercion to a function in the backwards direction.
- Defined in
- Mathlib.Data.FunLike.Equiv
- Cited by
- 42 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- EquivLike
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- EquivLikestatement and proof · cited by 165
Cited by51
Results whose statement or proof uses this declaration.
- EquivLike.toEquivproof · cited by 125
- EquivLike.apply_inv_applystatement · cited by 11
- EquivLike.right_invstatement · cited by 8
- EquivLike.left_invstatement · cited by 6
- FirstOrder.Language.StrongHomClass.toEquivproof · cited by 4
- EquivLike.inv_apply_applystatement · cited by 3
- Summable.map_iff_of_equivstatement and proof · cited by 2
- Graded.equivproof · cited by 2
- map_inv_le_map_inv_iffstatement · cited by 2
- FirstOrder.Language.StrongHomClass.realize_boundedFormulaproof · cited by 2
- StarMulEquiv.ofClassproof · cited by 2
- denselyOrdered_iff_of_orderIsoClassproof · cited by 2