| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The law of concretion. Theorem 9.5 of [Quine] p. 61. This version of opelopab 3570 uses bound-variable hypotheses in place of distinct variable conditions." |
| Ref | Expression |
|---|---|
| opelopabf.x |
|
| opelopabf.y |
|
| opelopabf.1 |
|
| opelopabf.2 |
|
| opelopabf.3 |
|
| opelopabf.4 |
|
| Ref | Expression |
|---|---|
| opelopabf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 1317 |
. . . 4
| |
| 2 | ax-17 1317 |
. . . 4
| |
| 3 | hbs1 1722 |
. . . . 5
| |
| 4 | 3 | hbsb 1723 |
. . . 4
|
| 5 | hbs1 1722 |
. . . 4
| |
| 6 | sbequ12 1545 |
. . . . 5
| |
| 7 | sbequ12 1545 |
. . . . 5
| |
| 8 | 6, 7 | sylan9bb 599 |
. . . 4
|
| 9 | 1, 2, 4, 5, 8 | cbvopab 3403 |
. . 3
|
| 10 | 9 | eleq2i 1961 |
. 2
|
| 11 | opelopabf.1 |
. . 3
| |
| 12 | opelopabf.2 |
. . 3
| |
| 13 | ax-17 1317 |
. . . 4
| |
| 14 | opelopabf.x |
. . . . 5
| |
| 15 | opelopabf.3 |
. . . . 5
| |
| 16 | 14, 15 | sbhypf 2452 |
. . . 4
|
| 17 | 13, 16 | sbbid 1617 |
. . 3
|
| 18 | opelopabf.y |
. . . 4
| |
| 19 | opelopabf.4 |
. . . 4
| |
| 20 | 18, 19 | sbhypf 2452 |
. . 3
|
| 21 | 11, 12, 17, 20 | opelopab 3570 |
. 2
|
| 22 | 10, 21 | bitri 190 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: iunfopabOLD 4543 pofun 15772 |
| 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-14 1312 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 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 df-eu 1775 df-mo 1776 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-v 2294 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-op 3053 df-opab 3396 |