Theorems · Theorem
EquivLike.injective_comp
∀ {E : Sort u_1} {α : Sort u_3} {β : Sort u_4} {γ : Sort u_5} [inst : EquivLike E α β] (e : E) (f : β → γ),
Function.Injective (f ∘ ⇑e) ↔ Function.Injective f- Defined in
- Mathlib.Data.FunLike.Equiv
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses Quot.sound
- Assumes
- EquivLike
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.
- DFunLike.coestatement · cited by 62,936
- EquivLikestatement and proof · cited by 165
- EquivLike.bijectiveproof · cited by 15
- Function.Injective.of_comp_iff'proof · cited by 8
Cited by4
Results whose statement or proof uses this declaration.
- Equiv.injective_compproof · cited by 18
- Module.Flat.transproof · cited by 9
- LinearMap.rTensor_injective_iff_subtypeproof · cited by 2
- AddMonoidAlgebra.map_injectiveproof · cited by 0