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.
(.) Let φ be a proposition. Then ¬φ 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 x and y be objects. Let φ(x) be a proposition depending on an object x. Assume x=y and φ(x). Then we know φ(y).
(.) Let φ and ψ be propositions. Assume φ implies ψ and ¬ψ. Then we know ¬φ.
(.) Let A and B be objects. Assume for all a ∈ A a∈B. Then we know A⊆B.
Using ¬A⊆B, it is enough to show A=B implies A⊆B. Assume A=B.
We have A⊆A. Using this and A=B, we conclude A⊆B.
Test yourself on this item.