| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A variable introduction law for class equality. |
| Ref | Expression |
|---|---|
| eqvinc.1 |
|
| Ref | Expression |
|---|---|
| eqvinc |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqvinc.1 |
. . 3
| |
| 2 | eleq1 1149 |
. . 3
| |
| 3 | 1, 2 | mpbii 168 |
. 2
|
| 4 | visset 1350 |
. . . . 5
| |
| 5 | eleq1 1149 |
. . . . 5
| |
| 6 | 4, 5 | mpbii 168 |
. . . 4
|
| 7 | 6 | adantl 305 |
. . 3
|
| 8 | 7 | 19.23aiv 952 |
. 2
|
| 9 | cleq2 1110 |
. . 3
| |
| 10 | cleq2 1110 |
. . . . 5
| |
| 11 | 10 | anbi2d 468 |
. . . 4
|
| 12 | 11 | biexdv 936 |
. . 3
|
| 13 | cleq1 1107 |
. . . 4
| |
| 14 | cleq1 1107 |
. . . . . . 7
| |
| 15 | cleqcom 1103 |
. . . . . . 7
| |
| 16 | 14, 15 | syl6bb 414 |
. . . . . 6
|
| 17 | 16 | anbi1d 469 |
. . . . 5
|
| 18 | 17 | biexdv 936 |
. . . 4
|
| 19 | eqvin 932 |
. . . 4
| |
| 20 | 1, 13, 18, 19 | vtoclb 1381 |
. . 3
|
| 21 | 9, 12, 20 | vtoclbg 1384 |
. 2
|
| 22 | 3, 8, 21 | pm5.21nii 504 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: eqvincf 1408 opabid 2099 findsg 2398 tfindsg 2402 f1fv 2916 indpi 3828 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-12 802 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 |