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

Automated Reasoning in Higher Order Logic

Automated Reasoning in Higher Order Logic

Impressum
Contact Person
Chad E Brown

Theorem

Let A and B be objects. Assume AB and BA. Then we have A=B.

Background

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 "AB" is a proposition.

Background for Proof

The following background is necessary for the proof.

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

(.) Let A and B be objects. Assume for all x xA implies xB and for all x xB implies xA. Then we know A=B.

(.) Let A, B and x be objects. Assume AB and xA. Then we know xB.

Proof

Since AB, we have for all x xA implies xB. Since BA, we know for all x xB implies xA. Using this and for all x xA implies xB, we conclude A=B.


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

Hide Background.

Test yourself on this item.


See Also

Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem Theorem