| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A condition allowing swap of uniqueness and existential quantifiers. |
| Ref | Expression |
|---|---|
| 2euswap |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | excomim 1081 |
. . . 4
| |
| 2 | 1 | a1i 8 |
. . 3
|
| 3 | 2moswap 1484 |
. . 3
| |
| 4 | 2, 3 | anim12d 561 |
. 2
|
| 5 | eu5 1448 |
. 2
| |
| 6 | eu5 1448 |
. 2
| |
| 7 | 4, 5, 6 | 3imtr4g 556 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: euxfr2 1972 2reuswap 1983 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 998 ax-gen 999 ax-8 1000 ax-10 1002 ax-11 1003 ax-12 1004 ax-17 1007 ax-4 1009 ax-5o 1011 ax-6o 1014 ax-9o 1159 ax-10o 1177 ax-16 1247 ax-11o 1255 |
| This theorem depends on definitions: df-bi 145 df-or 222 df-an 223 df-ex 1017 df-sb 1209 df-eu 1421 df-mo 1422 |