Satallax
Satallax is a higher-order
automated theorem prover.
Satallax won the THF division
of CASC-23 in 2011.

Matracas Mathematics Related Software

Impressum
Contact Person
Chad E Brown

Theorem

Let A, B and x be objects. Assume xAB. Let φ be a proposition. Assume xA implies ¬xB implies φ and ¬xA implies xB implies φ. Then we have φ.

Background

The following background is necessary to understand this theorem.

(.) Let A and x be objects. Then xA is a proposition.

(.) Let φ be a proposition. Then ¬φ is a proposition.

(.) Let x and y be objects. Then "xy" is an object.

Background for Proof

The following background is necessary for the proof.

(.) Let φ and ψ be propositions. Then φψ is a proposition.

(.) Let φ and ψ be propositions. Assume φ and ¬φ. Then we know ψ.

(.) Let A be an object. Let φ(a) be a proposition depending on a member a of A. Then {aA|φ(a)} is an object.

(.) Let A be an object. Let φ(a) be a proposition depending on a member a of A. Let x be an object. Assume x∈{aA|φ(a)}. Then we know xA.

(.) Let A be an object. Let φ(a) be a proposition depending on a member a of A. Let x be an object. Assume x∈{aA|φ(a)}. Then we know φ(x).

(.) Let φ and ψ be propositions. Assume φψ. Let θ be a proposition. Assume φ implies θ and ψ implies θ. Then we know θ.

(.) Let A and B be objects. Then "AB" is an object.

(.) Let A, B and x be objects. Assume xAB. Then we know xAxB.

(.) Let A and B be objects. Then AB is the object given by {xABxA∨¬xB}.

Proof

Claim: ¬xA∨¬xB.

Proof of Claim: Since xAB, we have x∈{xABxA∨¬xB}. Using this, we are done. This completes the proof of the claim.

Consider the case in which ¬xA.

Claim: xAxB.

Proof of Claim: It is enough to show xAB. Since xAB, we know x∈{xABxA∨¬xB}. Using this, we are done. This completes the proof of the claim.

Consider the case in which xA. Using this and ¬xA, we conclude φ.

Consider the case in which xB. Using this, ¬xA and ¬xA implies xB implies φ, we conclude φ.

Consider the case in which ¬xB.

Claim: xAxB.

Proof of Claim: We will show xAB. Since xAB, we have x∈{xABxA∨¬xB}. Using this, we are done. This completes the proof of the claim.

Consider the case in which xA. Using this, xA implies ¬xB implies φ and ¬xB, we conclude φ.

Consider the case in which xB. Using this and ¬xB, we conclude φ.


Click here to modify variable names (JavaScript Must Be Enabled).

Hide Background.

Test yourself on this item.


See Also

Theorem Theorem