Math Gate

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

Impressum
Contact Person
Chad E Brown

Theorem

Let A and x be objects. Assume xUA. Let φ be a proposition. Assume for all B xB implies BA 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 A be an object. Then UA 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. Then φψ is a proposition.

(.) Let φ(x) be a proposition depending on an object x. Then ∀x φ(x) is a proposition.

(.) Let φ(x) be a proposition depending on an object x. Then ∃x φ(x) is a proposition.

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

(.) Let φ(x) be a proposition depending on an object x. Assume ∀x φ(x). Let x be an object. Then we know φ(x).

(.) We know ∀Ax (xUA≡∃B (xBBA)).

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

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

(.) Let φ(x) be a proposition depending on an object x. Assume ∃x φ(x). Let ψ be a proposition. Assume for all x φ(x) implies ψ. Then we know ψ.

Proof

Claim:B (xBBA).

Proof of Claim: Using xUA, it is enough to show xUA≡∃B (xBBA). We will show ∀x (xUA≡∃B (xBBA)). We have ∀Ax (xUA≡∃B (xBBA)). Using this, we are done. This completes the proof of the claim.

Let B be such that xBBA. Then xB. Since xBBA, we know BA. Using this, xB and for all B xB implies BA implies φ, we conclude φ.


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

Hide Background.

Test yourself on this item.


See Also

Theorem Theorem Theorem