When applied to a term of the form t /\ (?p. t), the conversion
RIGHT_AND_PEXISTS_CONV returns the theorem:
|- t /\ (?p. u) = (?p'. t /\ (u[p'/p]))
where p' is a primed variant of the pair p that does not
contain any variables free in the input term.