Satallax is a higher-orderautomated theorem prover.
Satallax won the THF divisionof CASC-23 in 2011.
Let A, B and x be objects. Assume ¬x∈A and ¬x∈B. Then we have ¬x∈A⊕B.
The following background is necessary to understand this theorem.
(.) Let A and x be objects. Then x∈A is a proposition.
(.) Let φ be a proposition. Then ¬φ is a proposition.
(.) Let x and y be objects. Then "x⊕y" is an object.
The following background is necessary for the proof.
(.) 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 x∈A⊕B. Let φ be a proposition. Assume x∈A implies ¬x∈B implies φ and ¬x∈A implies x∈B implies φ. Then we know φ.
We will show x∈A⊕B implies false. Assume x∈A⊕B.
Since ¬x∈A, we know x∈A implies ¬x∈B implies false. Since ¬x∈B, we have ¬x∈A implies x∈B implies false. Using this, x∈A implies ¬x∈B implies false and x∈A⊕B, we conclude false.
Test yourself on this item.