PEXISTS_EQ : (term -> thm -> thm)
A |- t1 = t2
the inference rule PEXISTS_EQ returns the theorem:
A |- (?p. t1) = (?p. t2)
provided the none of the variables in p is not free in any of the assumptions.
A |- t1 = t2 -------------------------- PEXISTS_EQ "p" [where p is not free in A] A |- (?p. t1) = (?p. t2)