Theorems · Theorem

DFunLike.congr_fun

∀ {F : Sort u_1} {α : Sort u_2} {β : α → Sort u_3} [i : DFunLike F α β] {f g : F}, f = g → ∀ (x : α), f x = g x

Defined in: Mathlib.Data.FunLike.Basic
Cited by: 288 results in Mathlib
Foundations: Depth 5 from the axioms, rests on 5 definitions · uses no axioms
Assumes: DFunLike

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 288.