Theorems · Theorem
Equiv.eq_symm_comp
∀ {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} (e : α ≃ β) (f : γ → α) (g : γ → β), f = ⇑e.symm ∘ g ↔ ⇑e ∘ f = g- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Equivstatement and proof · cited by 8,337
- Equiv.symmstatement · cited by 3,681
- Equiv.reflproof · cited by 274
- Equiv.eq_symm_applyproof · cited by 85
- Equiv.arrowCongrproof · cited by 20
Cited by10
Results whose statement or proof uses this declaration.
- Equiv.trans_eq_refl_iff_eq_symmproof · cited by 2
- Prefunctor.symmetrifyCostarproof · cited by 1
- Prefunctor.symmetrifyStarproof · cited by 1
- LinearEquiv.eq_symm_compproof · cited by 1
- OrderMonoidIso.eq_symm_compproof · cited by 0
- MulEquiv.eq_symm_compproof · cited by 0
- ContinuousAddEquiv.eq_symm_compproof · cited by 0
- OrderAddMonoidIso.eq_symm_compproof · cited by 0
- ContinuousMulEquiv.eq_symm_compproof · cited by 0
- AddEquiv.eq_symm_compproof · cited by 0