Theorem bnj1340 30894

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1340.1	|- ( ps -> E. x th )
bnj1340.2	|- ( ch <-> ( ps /\ th ) )
bnj1340.3	|- ( ps -> A. x ps )

Assertion

Ref	Expression
bnj1340	|- ( ps -> E. x ch )

Proof of Theorem bnj1340

Step	Hyp	Ref	Expression
1		bnj1340.3	. . 3 |- ( ps -> A. x ps )
2		bnj1340.1	. . 3 |- ( ps -> E. x th )
3	1, 2	bnj596 30816	. 2 |- ( ps -> E. x ( ps /\ th ) )
4		bnj1340.2	. 2 |- ( ch <-> ( ps /\ th ) )
5	3, 4	bnj1198 30866	1 |- ( ps -> E. x ch )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   A.wal 1481   E.wex 1704

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-12 2047

This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-nf 1710

This theorem is referenced by:  bnj1450  31118