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

Scunak

Impressum
Contact Person
Chad E Brown

Theorem

Let A be an object. Let X and Y be members of ℘(A). Let a be a member of A. Assume X∈℘(Y) and aX. Then we have aY.

Background

The following background is necessary to understand this theorem.

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

(.) Let A be an object. Then ℘(A) is an object.

Background for Proof

The following background is necessary for the proof.

(.) Let A and B be objects. Then "AB" is a proposition.

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

(.) Let A and B be objects. Assume B∈℘(A). Then we know BA.

Proof

Since X∈℘(Y), we know XY. Using this and aX, we conclude aY.


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

Hide Background.

Test yourself on this item.