| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Lemma for proving that the union of two finite sets is finite. |
| Ref | Expression |
|---|---|
| unfilem3 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1oeq1 3675 |
. . . 4
| |
| 2 | 1 | cla4egv 1859 |
. . 3
|
| 3 | opreq1 3959 |
. . . . . . . . . . 11
| |
| 4 | 3 | eqeq2d 1483 |
. . . . . . . . . 10
|
| 5 | 4 | anbi2d 615 |
. . . . . . . . 9
|
| 6 | 5 | opabbidv 2665 |
. . . . . . . 8
|
| 7 | f1oeq1 3675 |
. . . . . . . 8
| |
| 8 | 6, 7 | syl 10 |
. . . . . . 7
|
| 9 | opreq1 3959 |
. . . . . . . . . 10
| |
| 10 | 9 | difeq1d 2154 |
. . . . . . . . 9
|
| 11 | difeq2 2150 |
. . . . . . . . 9
| |
| 12 | 10, 11 | eqtrd 1504 |
. . . . . . . 8
|
| 13 | f1oeq3 3677 |
. . . . . . . 8
| |
| 14 | 12, 13 | syl 10 |
. . . . . . 7
|
| 15 | 8, 14 | bitrd 527 |
. . . . . 6
|
| 16 | eleq2 1532 |
. . . . . . . . . 10
| |
| 17 | 16 | anbi1d 616 |
. . . . . . . . 9
|
| 18 | 17 | opabbidv 2665 |
. . . . . . . 8
|
| 19 | f1oeq1 3675 |
. . . . . . . 8
| |
| 20 | 18, 19 | syl 10 |
. . . . . . 7
|
| 21 | f1oeq2 3676 |
. . . . . . 7
| |
| 22 | opreq2 3960 |
. . . . . . . . 9
| |
| 23 | 22 | difeq1d 2154 |
. . . . . . . 8
|
| 24 | f1oeq3 3677 |
. . . . . . . 8
![]() |