| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Restricted uniqueness using implicit substitution. |
| Ref | Expression |
|---|---|
| rmo4.1 |
|
| Ref | Expression |
|---|---|
| reu7 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reu6 1932 |
. 2
| |
| 2 | rmo4.1 |
. . . . . . 7
| |
| 3 | eqeq1 1481 |
. . . . . . . 8
| |
| 4 | eqcom 1477 |
. . . . . . . 8
| |
| 5 | 3, 4 | syl6bb 536 |
. . . . . . 7
|
| 6 | 2, 5 | imbi12d 626 |
. . . . . 6
|
| 7 | 6 | cbvralv 1800 |
. . . . 5
|
| 8 | 7 | rexbii 1668 |
. . . 4
|
| 9 | eqeq1 1481 |
. . . . . . 7
| |
| 10 | 9 | imbi2d 612 |
. . . . . 6
|
| 11 | 10 | ralbidv 1663 |
. . . . 5
|
| 12 | 11 | cbvrexv 1801 |
. . . 4
|
| 13 | 8, 12 | bitr 173 |
. . 3
|
| 14 | 13 | anbi2i 480 |
. 2
|
| 15 | 1, 14 | bitr 173 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-11 967 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 df-eu 1382 df-cleq 1469 df-clel 1472 df-ral 1649 df-rex 1650 df-reu 1651 |