Theorems · Theorem
EquivLike.comp_bijective
∀ {F : Sort u_2} {α : Sort u_3} {β : Sort u_4} {γ : Sort u_5} [inst : EquivLike F β γ] (f : α → β) (e : F),
Function.Bijective (⇑e ∘ f) ↔ Function.Bijective f- Defined in
- Mathlib.Data.FunLike.Equiv
- Cited by
- 3 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Function.Bijectivestatement · cited by 863
- EquivLikestatement and proof · cited by 165
- Function.Bijective.of_comp_iff'proof · cited by 26
- EquivLike.bijectiveproof · cited by 15
Cited by3
Results whose statement or proof uses this declaration.
- Equiv.comp_bijectiveproof · cited by 4
- Prefunctor.bijective_costar_iff_bijective_starproof · cited by 2
- CategoryTheory.Limits.Multifork.isLimit_types_iffproof · cited by 2