Theorems · Inductive type
Function.HasUncurry
Type u_5 → outParam (Type u_6) → outParam (Type u_7) → Type (max (max u_5 u_6) u_7)
Records a way to turn an element of α into a function from β to γ. The most generic use
is to recursively uncurry. For instance f : α → β → γ → δ will be turned into
↿f : α × β × γ → δ. One can also add instances for bundled maps.
- Defined in
- Mathlib.Logic.Function.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by7
Results whose statement or proof uses this declaration.
- Function.HasUncurry.uncurrystatement and proof · cited by 57
- Function.HasUncurry.noConfusionstatement and proof · cited by 0
- Function.HasUncurry.noConfusionTypestatement and proof · cited by 0
- Function.HasUncurry.recOnstatement and proof · cited by 0
- Function.HasUncurry.mk.noConfusionstatement · cited by 0
- Function.HasUncurry.casesOnstatement and proof · cited by 0
- Function.HasUncurry.ctorIdxstatement and proof · cited by 0