Theorems · Theorem
Equiv.comp_symm_eq
∀ {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} (e : α ≃ β) (f : β → γ) (g : α → γ), g ∘ ⇑e.symm = f ↔ g = f ∘ ⇑e- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 8 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 by8
Results whose statement or proof uses this declaration.
- LinearEquiv.comp_symm_eqproof · cited by 1
- OrderMonoidIso.comp_symm_eqproof · cited by 0
- AddEquiv.comp_symm_eqproof · cited by 0
- ContinuousAddEquiv.comp_symm_eqproof · cited by 0
- Equiv.eq_conjproof · cited by 0
- MulEquiv.comp_symm_eqproof · cited by 0
- ContinuousMulEquiv.comp_symm_eqproof · cited by 0
- OrderAddMonoidIso.comp_symm_eqproof · cited by 0