* Question Completion Status: The link above provides a list of ten symbolically written statements which are numbered 1-10. Each of the statements matches one blank space in the text below. Fill each of the blanks with the number of the matching statement. Let X be the universal set for variables x and y, and let P(x) be an open sentence. Let T be a nonempty set such that for each t in T, there is a corresponding set At. The set is called the truth set of P(x). is a symbolic form of the statement saying that for some x in X, P(x). is a symbolic form of the statement saying that for every x in X, P(x). The statement saying that "for some x in X, P(x)" is true if The statement saying that "for every x in X, P(x)" is true if x is an element of the union of the sets At provided that x is an element of the intersection of the sets provided that The sets in the family {At} are pairwise disjoint provided that The negation of "for some x in X, for every y in X, P(x) implies P(y)" is The negation of "for every x in X, for some y in X, P(x) and P(y)" is x Bb 85993335 × Bb 85989240 cet-learn-us-east-1-prod-fleet01-xythos&X-Blackboard-Expir... X 1. Vrex P(x) 2. Элет х 6 At 3. Vt,SET (ts) → (An A, = 0) 4. {x = X | P(x)} 5. VIET x Є At 6. xexyEx(P(x) V-P(y)) 7. {x Є X | P(x)} ± 0 8. xex P(x) 9. {x X|P(x)} = X 10. Vexyex (P(x) A-P(y)) ل 200m W