Theorems · Definition
Equiv.sigmaCongr
{α₁ : Type u_1} →
{α₂ : Type u_2} →
{β₁ : α₁ → Type u_3} → {β₂ : α₂ → Type u_4} → (f : α₁ ≃ α₂) → ((a : α₁) → β₁ a ≃ β₂ (f a)) → Sigma β₁ ≃ Sigma β₂Transporting a sigma type through an equivalence of the base and a family of equivalences of matching fibers
- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 4 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Equivstatement and proof · cited by 8,337
- Equiv.transproof · cited by 337
- Equiv.sigmaCongrRightproof · cited by 12
- Equiv.sigmaCongrLeftproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- Cardinal.mk_sigma_congrproof · cited by 1
- Finpartition.exists_enumerationproof · cited by 1
- Cardinal.mk_sigma_congr'proof · cited by 0
- Cardinal.mk_sigma_congr_liftproof · cited by 0