Theorems · Theorem · combinatorics
piFinTwoEquiv_apply
∀ (α : Fin 2 → Type u), ⇑(piFinTwoEquiv α) = fun f => (f 0, f 1)
- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, 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 and proof · cited by 62,936
- Equivstatement · cited by 8,337
- piFinTwoEquivstatement and proof · cited by 19
Cited by9
Results whose statement or proof uses this declaration.
- groupHomology.comp_d₂₁_eqproof · cited by 10
- groupHomology.comp_d₃₂_eqproof · cited by 6
- groupHomology.chainsMap_f_2_comp_chainsIso₂proof · cited by 3
- groupHomology.chainsMap_f_3_comp_chainsIso₃proof · cited by 2
- summable_prod_eisSummandproof · cited by 1
- Module.Basis.finTwoProd_oneproof · cited by 1
- Module.Basis.finTwoProd_zeroproof · cited by 1
- Nat.image_piFinTwoEquiv_finMulAntidiagproof · cited by 0
- groupHomology.δ₁_applyproof · cited by 0