Theorems · Theorem
Equiv.congr_fun
∀ {α : Sort u} {β : Sort v} {f g : α ≃ β}, f = g → ∀ (x : α), f x = g x- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- DFunLike.congr_funproof · cited by 288
Cited by7
Results whose statement or proof uses this declaration.
- Equiv.Perm.congr_funproof · cited by 2
- Equiv.Perm.sumCongrHom_injectiveproof · cited by 2
- LinearEquiv.isOfFinOrder_of_finite_of_span_eq_top_of_mapsToproof · cited by 1
- Equiv.Perm.sigmaCongrRightHom_injectiveproof · cited by 1
- Equiv.Perm.subtypeCongrHom_injectiveproof · cited by 1
- EquivFunctor.mapEquiv.injectiveproof · cited by 0
- AlternatingMap.domCoprod.summand_eq_zero_of_smul_invariantproof · cited by 0