Check if a prime field element is a square of an even field element.
Same as pfield-squarep except restricts the root to be even.
Theorem:
(defthm pfield-even-squarep-suff (implies (and (fep r p) (evenp r) (equal (mul r r p) x)) (pfield-even-squarep x p)))
Theorem:
(defthm booleanp-of-pfield-even-squarep (b* ((yes/no (pfield-even-squarep x p))) (booleanp yes/no)) :rule-classes :rewrite)