| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule of specialization, using implicit substitition. Compare Theorem 7.3 of [Quine] p. 44. (Unnecessary distinct variable restrictions were removed by Andrew Salmon, 12-Aug-2011.) |
| Ref | Expression |
|---|---|
| cla4gf.1 |
|
| cla4gf.2 |
|
| cla4gf.3 |
|
| Ref | Expression |
|---|---|
| cla4gf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elisset 2299 |
. 2
| |
| 2 | isset 2296 |
. . . . 5
| |
| 3 | cla4gf.1 |
. . . . . . . 8
| |
| 4 | 3 | hblem 1993 |
. . . . . . 7
|
| 5 | 4 | hbeleq 1997 |
. . . . . 6
|
| 6 | ax-17 1317 |
. . . . . 6
| |
| 7 | eqeq1 1890 |
. . . . . 6
| |
| 8 | 5, 6, 7 | cbvex 1529 |
. . . . 5
|
| 9 | 2, 8 | bitri 190 |
. . . 4
|
| 10 | cla4gf.3 |
. . . . . 6
| |
| 11 | 10 | biimpd 170 |
. . . . 5
|
| 12 | 11 | eximi 1387 |
. . . 4
|
| 13 | 9, 12 | sylbi 216 |
. . 3
|
| 14 | cla4gf.2 |
. . . 4
| |
| 15 | 14 | 19.36 1429 |
. . 3
|
| 16 | 13, 15 | sylib 215 |
. 2
|
| 17 | 1, 16 | syl 12 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cla4egf 2362 cla4gv 2364 rcla4 2373 rcla4OLD 2374 elabgt 2400 moi 2436 ac6sfilem1 5506 ac6sfilem3 5508 ordtypelem5 5688 ordtypelem6 5689 ordtypelem5OLD 15379 ordtypelem6OLD 15380 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 df-clab 1872 df-cleq 1877 df-clel 1880 df-v 2294 |