Satallax is a higher-orderautomated theorem prover. Satallax won the THF divisionof CASC-23 in 2011.
Matracas Mathematics Related Software
Let A be an object. Let X and Y be members of ℘(A). Assume A \ Y⊆A \ X. Then we have X⊆Y.
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 φ be a proposition. Then ¬φ is a proposition.
(.) Let φ and ψ be propositions. Assume φ and ¬φ. Then we know ψ.
(.) "false" is a proposition.
(.) Let φ be a proposition. Assume ¬φ implies false. Then we know φ.
(.) Let A, B and x be objects. Assume A⊆B and x∈A. Then we know x∈B.
(.) Let A be an object. Let X and Y be members of ℘(A). Assume for all a ∈ A a∈X implies a∈Y. Then we know X⊆Y.
(.) Let A, B and x be objects. Assume x∈A and ¬x∈B. Then we know x∈A \ B.
(.) Let A, B and x be objects. Assume x∈A \ B. Then we know ¬x∈B.
It is enough to show for all a ∈ A a∈X implies a∈Y. Let a be a member of A. Assume a∈X. We will show ¬a∈Y implies false. Assume ¬a∈Y. Using a∈X, it is enough to show ¬a∈X. It is enough to show a∈A \ X. Since ¬a∈Y, we have a∈A \ Y. Using this and A \ Y⊆A \ X, we are done.
Click here to modify variable names (JavaScript Must Be Enabled).
Hide Background.
Test yourself on this item.