| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A variable introduction law for class equality, using bound-variable hypotheses instead of distinct variable conditions. |
| Ref | Expression |
|---|---|
| eqvincf.1 |
|
| eqvincf.2 |
|
| eqvincf.3 |
|
| Ref | Expression |
|---|---|
| eqvincf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqvincf.3 |
. . 3
| |
| 2 | 1 | eqvinc 1880 |
. 2
|
| 3 | eqvincf.1 |
. . . . 5
| |
| 4 | 3 | hbeleq 1565 |
. . . 4
|
| 5 | eqvincf.2 |
. . . . 5
| |
| 6 | 5 | hbeleq 1565 |
. . . 4
|
| 7 | 4, 6 | hban 1008 |
. . 3
|
| 8 | ax-17 970 |
. . 3
| |
| 9 | eqeq1 1479 |
. . . 4
| |
| 10 | eqeq1 1479 |
. . . 4
| |
| 11 | 9, 10 | anbi12d 627 |
. . 3
|
| 12 | 7, 8, 11 | cbvex 1165 |
. 2
|
| 13 | 2, 12 | bitr 173 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: fvopab4gf 3776 fvopabgf 3782 fvopabnf 3783 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 961 ax-gen 962 ax-8 963 ax-9 964 ax-10 965 ax-12 967 ax-17 970 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-10o 1139 ax-ext 1458 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 980 df-sb 1171 df-clab 1463 df-cleq 1468 df-clel 1471 df-v 1809 |