| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A condition allowing swap of uniqueness and existential quantifiers. |
| Ref | Expression |
|---|---|
| 2reuswap |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 1205 |
. . 3
| |
| 2 | moanimv 1052 |
. . . 4
| |
| 3 | 2 | bial 695 |
. . 3
|
| 4 | 1, 3 | bitr4 154 |
. 2
|
| 5 | 2euswap 1065 |
. . 3
| |
| 6 | df-reu 1207 |
. . . 4
| |
| 7 | df-rex 1206 |
. . . . . 6
| |
| 8 | r19.42v 1303 |
. . . . . 6
| |
| 9 | an12 370 |
. . . . . . 7
| |
| 10 | 9 | biex 733 |
. . . . . 6
|
| 11 | 7, 8, 10 | 3bitr3 156 |
. . . . 5
|
| 12 | 11 | bieu 1014 |
. . . 4
|
| 13 | 6, 12 | bitr 151 |
. . 3
|
| 14 | df-reu 1207 |
. . . 4
| |
| 15 | r19.42v 1303 |
. . . . . 6
| |
| 16 | df-rex 1206 |
. . . . . 6
| |
| 17 | 15, 16 | bitr3 153 |
. . . . 5
|
| 18 | 17 | bieu 1014 |
. . . 4
|
| 19 | 14, 18 | bitr 151 |
. . 3
|
| 20 | 5, 13, 19 | 3imtr4g 426 |
. 2
|
| 21 | 4, 20 | sylbi 174 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: reuxfr2 1579 |
| 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-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-ral 1205 df-rex 1206 df-reu 1207 |