Prove the following statement.

The following statement is either true or false. If the statement is true, prove it. If the statement is false, give a specific counterexample... If A, B, C and D are sets, then (A × B)∩(C × D) = (A ∩ C)×(B ∩ D).
Let A and B be sets. Prove the following statement: B ⊆ A if and only if ¬A ⊆ ¬B
Let A and B be sets. Prove the following statement: B ⊆ A if and only if A ⊆ B.
Of the following statements, one is true and one is false. Prove the true statement, and for the false statement, write out its negation and prove that. (a) For all sets A, B and C, if(ANB) - C = Ø, then (AUB) CC. (b) , For all sets A, B and C, if (AUB) CC, then (An:B) - C = Ø.
1. Prove the following statement by mathematical induction. For all positive integers n. 2++ n+1) = 2. Prove the following statement by mathematical induction. For all nonnegative integers n, 3 divides 22n-1. 3. Prove the following statement by mathematical induction. For all integers n 27,3" <n!
Let A, B, and C be sets. Prove the following statement: (A − B) ∩ (C − A) = ∅
4. (4 points) Prove the truth or falsity of the following statements. To prove a statement true, give a formal argument (in cases involving implications among FD's, use Armstrong's Axiom System). To prove falsity, give a counterexample. 1. {A + B, DB → C} F{A+C} 2. {X+W, WZ+Y} F{XZ → WY} 3. {A D, B7C, F + B, CD + E|| F{AF → E} 4. Suppose R is a relation scheme and F a set of functional dependencies applicable to...
Prove or give a counterexample to the following statement: If the coefficient matrix of a system of m linear equations in n unknowns has rank m, then the system has a solution.
Use the method of direct proof to prove the following statement: For integers a and b, if a is odd or b is odd, then (a + 7)(b 5) is even.
Prove each problem, prove by induction
1)Statement 2 Statement: 3 (n-1)n 2forn 2 1