CURRY_EXISTS_CONV : conv
STRUCTURE
PairRules
LIBRARY
pair
SYNOPSIS
Currys paired existential quantifications into consecutive existential quantifications.
EXAMPLE
- CURRY_EXISTS_CONV (Term `?(x,y). x + y = y + x`);
> val it = |- (?(x,y). x + y = y + x) = ?x y. x + y = y + x : thm

- CURRY_EXISTS_CONV (Term `?((w,x),(y,z)). w+x+y+z = z+y+x+w`);
> val it =
    |- (?((w,x),y,z). w + x + y + z = z + y + x + w) =
       ?(w,x) (y,z). w + x + y + z = z + y + x + w : thm

FAILURE
CURRY_EXISTS_CONV tm fails if tm is not a paired existential quantification.
SEEALSO
CURRY_CONV, UNCURRY_CONV, UNCURRY_EXISTS_CONV, CURRY_FORALL_CONV, UNCURRY_FORALL_CONV
HOL  Kananaskis-13