| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > djufi | Structured version Visualization version GIF version | ||
| Description: The disjoint union of two finite sets is finite. (Contributed by NM, 22-Oct-2004.) |
| Ref | Expression |
|---|---|
| djufi | ⊢ ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴 ⊔ 𝐵) ≺ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-dju 9923 | . 2 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) | |
| 2 | 0elon 6418 | . . . . . 6 ⊢ ∅ ∈ On | |
| 3 | relsdom 8974 | . . . . . . 7 ⊢ Rel ≺ | |
| 4 | 3 | brrelex1i 5721 | . . . . . 6 ⊢ (𝐴 ≺ ω → 𝐴 ∈ V) |
| 5 | xpsnen2g 9087 | . . . . . 6 ⊢ ((∅ ∈ On ∧ 𝐴 ∈ V) → ({∅} × 𝐴) ≈ 𝐴) | |
| 6 | 2, 4, 5 | sylancr 587 | . . . . 5 ⊢ (𝐴 ≺ ω → ({∅} × 𝐴) ≈ 𝐴) |
| 7 | sdomen1 9143 | . . . . 5 ⊢ (({∅} × 𝐴) ≈ 𝐴 → (({∅} × 𝐴) ≺ ω ↔ 𝐴 ≺ ω)) | |
| 8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝐴 ≺ ω → (({∅} × 𝐴) ≺ ω ↔ 𝐴 ≺ ω)) |
| 9 | 8 | ibir 268 | . . 3 ⊢ (𝐴 ≺ ω → ({∅} × 𝐴) ≺ ω) |
| 10 | 1on 8500 | . . . . . 6 ⊢ 1o ∈ On | |
| 11 | 3 | brrelex1i 5721 | . . . . . 6 ⊢ (𝐵 ≺ ω → 𝐵 ∈ V) |
| 12 | xpsnen2g 9087 | . . . . . 6 ⊢ ((1o ∈ On ∧ 𝐵 ∈ V) → ({1o} × 𝐵) ≈ 𝐵) | |
| 13 | 10, 11, 12 | sylancr 587 | . . . . 5 ⊢ (𝐵 ≺ ω → ({1o} × 𝐵) ≈ 𝐵) |
| 14 | sdomen1 9143 | . . . . 5 ⊢ (({1o} × 𝐵) ≈ 𝐵 → (({1o} × 𝐵) ≺ ω ↔ 𝐵 ≺ ω)) | |
| 15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝐵 ≺ ω → (({1o} × 𝐵) ≺ ω ↔ 𝐵 ≺ ω)) |
| 16 | 15 | ibir 268 | . . 3 ⊢ (𝐵 ≺ ω → ({1o} × 𝐵) ≺ ω) |
| 17 | unfi2 9330 | . . 3 ⊢ ((({∅} × 𝐴) ≺ ω ∧ ({1o} × 𝐵) ≺ ω) → (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ≺ ω) | |
| 18 | 9, 16, 17 | syl2an 596 | . 2 ⊢ ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ≺ ω) |
| 19 | 1, 18 | eqbrtrid 5158 | 1 ⊢ ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴 ⊔ 𝐵) ≺ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2107 Vcvv 3463 ∪ cun 3929 ∅c0 4313 {csn 4606 class class class wbr 5123 × cxp 5663 Oncon0 6363 ωcom 7869 1oc1o 8481 ≈ cen 8964 ≺ csdm 8966 ⊔ cdju 9920 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-int 4927 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7416 df-om 7870 df-1st 7996 df-2nd 7997 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-1o 8488 df-er 8727 df-en 8968 df-dom 8969 df-sdom 8970 df-fin 8971 df-dju 9923 |
| This theorem is referenced by: canthp1lem2 10675 |
| Copyright terms: Public domain | W3C validator |