| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Restricted specialization with implicit substitution. |
| Ref | Expression |
|---|---|
| rcla4dv.1 |
|
| Ref | Expression |
|---|---|
| rcla4dv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rcla4dv.1 |
. . . . . . 7
| |
| 2 | 1 | expcom 374 |
. . . . . 6
|
| 3 | 2 | pm5.74d 583 |
. . . . 5
|
| 4 | 3 | rcla4v 1864 |
. . . 4
|
| 5 | r19.21v 1708 |
. . . 4
| |
| 6 | 4, 5 | syl5ibr 207 |
. . 3
|
| 7 | 6 | pm2.86d 71 |
. 2
|
| 8 | 7 | impcom 351 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ralxfrd 2887 imonclem 10583 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-12 965 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-ext 1452 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 978 df-sb 1168 df-clab 1457 df-cleq 1462 df-clel 1465 df-ral 1641 df-v 1803 |