Theorem reubii 1774

Description: Formula-building rule for restricted existential quantifier (inference rule).

Hypothesis

Ref	Expression
reubii.1	|- (ph <-> ps)

Assertion

Ref	Expression
reubii	|- (E!x e. A ph <-> E!x e. A ps)

Proof of Theorem reubii

Step	Hyp	Ref	Expression
1		reubii.1	. . 3 |- (ph <-> ps)
2	1	a1i 8	. 2 |- (x e. A -> (ph <-> ps))
3	2	reubiia 1773	1 |- (E!x e. A ph <-> E!x e. A ps)

Syntax hints:   <-> wb 146   e. wcel 955  E!wreu 1639

This theorem is referenced by:  aceq2 4703  infmsup 6015  uzwo3 6166  cnlnadjlem3 9917  cnlnadjlem4 9918  cnlnadjlem5 9919

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978  df-eu 1375  df-reu 1643

Copyright terms: Public domain