Given an array, find a prime number and return true only if it is a sum of any other two values present in the array; otherwise return false.
Implement prime_is_two_sum(nums), returning a Boolean. The two summands must come from two distinct indices and must not be the index of the prime number being checked. Return false if no qualifying prime exists.
def prime_is_two_sum(nums):