Mathlib Map

Theorems · Theorem

Equiv.piCongrRight_apply

∀ {α : Sort u_1} {β₁ : α → Sort u_9} {β₂ : α → Sort u_10} (F : (a : α) → β₁ a ≃ β₂ a) (a : (i : α) → β₁ i) (i : α),
  (Equiv.piCongrRight F) a i = Pi.map (fun a => ⇑(F a)) a i
Defined in
Mathlib.Logic.Equiv.Basic
Cited by
2 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Nat.mem_finMulAntidiag · cited by 7Nat.mem_finMulAntidiagEquiv.piCongr_apply_apply · cited by 1Equiv.piCongr_apply_applyDFunLike.coe · cited by 62936DFunLike.coeEquiv · cited by 8337EquivPi.map · cited by 60Pi.mapEquiv.piCongrRight · cited by 15Equiv.piCongrRightEquiv.piCongrRight_applyCITED BYCITES

Cites4

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

Cited by2

Results whose statement or proof uses this declaration.