| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference adding 2 restricted existential quantifiers to both sides of an equivalence. |
| Ref | Expression |
|---|---|
| ralbii.1 |
|
| Ref | Expression |
|---|---|
| 2rexbii |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ralbii.1 |
. . 3
| |
| 2 | 1 | rexbii 1668 |
. 2
|
| 3 | 2 | rexbii 1668 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: unxpdomlem 4843 dffsum 6998 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 963 ax-4 973 ax-5o 975 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-rex 1650 |