Automated Reasoning in Higher Order Logic
Matracas Mathematics Related Software
Let A be an object. Let X, Y and Z be members of ℘(A). Assume Y⊆Z. Then we have X∩Y⊆Z.
The following background is necessary to understand this theorem.
(.) Let A and x be objects. Then x∈A is a proposition.
(.) Let A be an object. Then ℘(A) is an object.
(.) Let A and B be objects. Then "A⊆B" is a proposition.
(.) Let A and B be objects. Then "A∩B" is an object.
The following background is necessary for the proof.
(.) Let A and B be objects. Assume for all a ∈ A a∈B. Then we know A⊆B.
(.) Let A, B and x be objects. Assume A⊆B and x∈A. Then we know x∈B.
(.) Let A, B and x be objects. Assume x∈A∩B. Then we know x∈B.
It is enough to show for all x ∈ X∩Y x∈Z. Let x be a member of X∩Y. We know x∈Y. Using this and Y⊆Z, we conclude x∈Z.
Click here to modify variable names (JavaScript Must Be Enabled).
Hide Background.
Test yourself on this item.
Theorem