Theorems · Definition

Equiv.piCongrLeft

{α : Sort u_1} → {β : Sort u_4} → (P : β → Sort w) → (e : α ≃ β) → ((a : α) → P (e a)) ≃ ((b : β) → P b)

Transporting dependent functions through an equivalence of the base, expressed as a "simplification".

Defined in: Mathlib.Logic.Equiv.Basic
Cited by: 36 results in Mathlib
Foundations: Depth 19 from the axioms · uses propext, Classical.choice, Quot.sound

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.