| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Transfer existential
uniqueness from a variable |
| Ref | Expression |
|---|---|
| reuxfr2.1 |
|
| reuxfr2.2 |
|
| Ref | Expression |
|---|---|
| reuxfr2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2reuswap 1341 |
. . . 4
| |
| 2 | reuxfr2.2 |
. . . . . 6
| |
| 3 | moan 1046 |
. . . . . 6
| |
| 4 | 2, 3 | syl 12 |
. . . . 5
|
| 5 | ancom 333 |
. . . . . . 7
| |
| 6 | anass 336 |
. . . . . . 7
| |
| 7 | 5, 6 | bitr 151 |
. . . . . 6
|
| 8 | 7 | bimo 1031 |
. . . . 5
|
| 9 | 4, 8 | sylib 173 |
. . . 4
|
| 10 | 1, 9 | mprg 1249 |
. . 3
|
| 11 | 2reuswap 1341 |
. . . 4
| |
| 12 | moeq 1431 |
. . . . . . 7
| |
| 13 | 12 | moani 1047 |
. . . . . 6
|
| 14 | ancom 333 |
. . . . . . . 8
| |
| 15 | an12 370 |
. . . . . . . 8
| |
| 16 | 14, 15 | bitr 151 |
. . . . . . 7
|
| 17 | 16 | bimo 1031 |
. . . . . 6
|
| 18 | 13, 17 | mpbi 164 |
. . . . 5
|
| 19 | 18 | a1i 7 |
. . . 4
|
| 20 | 11, 19 | mprg 1249 |
. . 3
|
| 21 | 10, 20 | impbi 139 |
. 2
|
| 22 | reuxfr2.1 |
. . . 4
| |
| 23 | pm4.2i 149 |
. . . . 5
| |
| 24 | 23 | ceqsrexv 1413 |
. . . 4
|
| 25 | 22, 24 | syl 12 |
. . 3
|
| 26 | 25 | bireua 1319 |
. 2
|
| 27 | 21, 26 | bitr 151 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: reuxfr 1580 |
| 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 ax-ext 1074 |
| 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-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-rex 1206 df-reu 1207 df-v 1349 |