| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Double restricted existential quantification. |
| Ref | Expression |
|---|---|
| r2ex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 1206 |
. 2
| |
| 2 | 19.42v 966 |
. . . 4
| |
| 3 | anass 336 |
. . . . 5
| |
| 4 | 3 | biex 733 |
. . . 4
|
| 5 | df-rex 1206 |
. . . . 5
| |
| 6 | 5 | anbi2i 367 |
. . . 4
|
| 7 | 2, 4, 6 | 3bitr4 158 |
. . 3
|
| 8 | 7 | biex 733 |
. 2
|
| 9 | 1, 8 | bitr4 154 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: rexcom 1313 cbvop 2473 genpv 3896 axcnre 4087 pjthu 5241 pjthu2 5242 pjpj0 5259 spanun 5450 osumlem7 5536 5oalem7 5550 3oalem3 5554 |
| 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-17 925 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-rex 1206 |