fact: Definition uncurry {A} {B : A -> Type} {C : forall x : A, B x -> Type} (f : forall s : &{ x : A & B x }, C s.1 s.2) : forall (x : A) (b : B x), C x b := fun x b => f &(x & b).
imports: Equations Utf8 DepElimDec EqDecInstances