Satallax is a higher-orderautomated theorem prover. Satallax won the THF divisionof CASC-23 in 2011.
Automated Reasoning in Higher Order Logic
Let A and B be objects. Assume A⊆B. Then we have A \ B=∅.
The following background is necessary to understand this theorem.
(.) Let x and y be objects. Then x=y is a proposition.
(.) ∅ 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 x be objects. Then x∈A is a proposition.
(.) Let φ be a proposition. Then ¬φ is a proposition.
(.) Let φ and ψ be propositions. Assume φ and ¬φ. Then we know ψ.
(.) Let A and B be objects. Assume for all x x∈A implies x∈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∈A.
(.) Let A, B and x be objects. Assume x∈A \ B. Then we know ¬x∈B.
(.) Let A be an object. Assume A⊆∅. Then we know A=∅.
We will show A \ B⊆∅. It is enough to show for all x x∈A \ B implies x∈∅. Let x be an object. Assume x∈A \ B.
Claim: x∈B.
Proof of Claim: Since x∈A \ B, we know x∈A. Using this and A⊆B, we are done. This completes the proof of the claim.
Click here to modify variable names (JavaScript Must Be Enabled).
Hide Background.
Test yourself on this item.