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 be an object. Let X be a member of ℘(A). Then we have A \ (A \ X)⊆X.

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.

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

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

Background for Proof

The following background is necessary for the proof.

(.) Let A be an object. Let X be a member of ℘(A). Then we know A \ X∈℘(A).

(.) Let A be an object. Let X and Y be members of ℘(A). Assume for all aA aX implies aY. Then we know XY.

(.) Let A be an object. Let X be a member of ℘(A). Let a be a member of A. Assume aA \ (A \ X). Then we know aX.

Proof

We know for all aA aA \ (A \ X) implies aX. Using this, we conclude A \ (A \ X)⊆X.


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

Hide Background.

Test yourself on this item.