HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem bireu 1320
Description: Formula-building rule for restricted existential quantifier (inference rule).
Hypothesis
Ref Expression
bireu.1 |- (ph <-> ps)
Assertion
Ref Expression
bireu |- (E!x e. A ph <-> E!x e. A ps)

Proof of Theorem bireu
StepHypRef Expression
1 bireu.1 . . 3 |- (ph <-> ps)
21a1i 7 . 2 |- (x e. A -> (ph <-> ps))
32bireua 1319 1 |- (E!x e. A ph <-> E!x e. A ps)
Colors of variables: wff set class
Syntax hints:   <-> wb 127   e. wcel 1092  E!wreu 1203
This theorem is referenced by:  aceq2 3554  uzwo3 4616
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677  ax-9 799  ax-12 802  ax-17 925
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-eu 1009  df-reu 1207
metamath.org