| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rearrange existential quantifiers. |
| Ref | Expression |
|---|---|
| reeanv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | anass 336 |
. . . . 5
| |
| 2 | an4 388 |
. . . . 5
| |
| 3 | 1, 2 | bitr3 153 |
. . . 4
|
| 4 | 3 | bi2ex 734 |
. . 3
|
| 5 | exdistr 967 |
. . 3
| |
| 6 | eeanv 980 |
. . 3
| |
| 7 | 4, 5, 6 | 3bitr3 156 |
. 2
|
| 8 | df-rex 1206 |
. . . 4
| |
| 9 | 8 | birex 1224 |
. . 3
|
| 10 | df-rex 1206 |
. . 3
| |
| 11 | 9, 10 | bitr 151 |
. 2
|
| 12 | df-rex 1206 |
. . 3
| |
| 13 | df-rex 1206 |
. . 3
| |
| 14 | 12, 13 | anbi12i 369 |
. 2
|
| 15 | 7, 11, 14 | 3bitr4 158 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: tfrlem5 2953 unfi 3441 kmlem8 3587 climunii 4883 infxpidmlem7 4939 hlimunii 5143 pjthu 5241 pjthu2 5242 pjpj0 5259 |
| 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-7 676 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 |