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 and B⊆A. 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.
(.) Let A and B be objects. Then "A⊆B" is a proposition.
The following background is necessary for the proof.
(.) Let A and x be objects. Then x∈A is a proposition.
(.) Let A and B be objects. Assume for all x x∈A implies x∈B and for all x x∈B implies x∈A. Then we know A=B.
(.) Let A, B and x be objects. Assume A⊆B and x∈A. Then we know x∈B.
Since A⊆B, we have for all x x∈A implies x∈B. Since B⊆A, we know for all x x∈B implies x∈A. Using this and for all x x∈A implies x∈B, we conclude A=B.
Click here to modify variable names (JavaScript Must Be Enabled).
Hide Background.
Test yourself on this item.
Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem