| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference adding different restricted existential quantifiers to each side of an equivalence. |
| Ref | Expression |
|---|---|
| birex2.1 |
|
| Ref | Expression |
|---|---|
| birex2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | birex2.1 |
. . 3
| |
| 2 | 1 | biex 733 |
. 2
|
| 3 | df-rex 1206 |
. 2
| |
| 4 | df-rex 1206 |
. 2
| |
| 5 | 2, 3, 4 | 3bitr4 158 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: birexa 1229 wefrc 2195 bnd2 3549 sumdmdi 5785 |
| 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-gen 677 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-rex 1206 |