| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infunabs | Structured version Visualization version GIF version | ||
| Description: An infinite set is equinumerous to its union with a smaller one. (Contributed by NM, 28-Sep-2004.) (Revised by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| infunabs | ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ∪ 𝐵) ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → 𝐴 ∈ dom card) | |
| 2 | reldom 8963 | . . . . . 6 ⊢ Rel ≼ | |
| 3 | 2 | brrelex1i 5707 | . . . . 5 ⊢ (𝐵 ≼ 𝐴 → 𝐵 ∈ V) |
| 4 | 3 | 3ad2ant3 1153 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ V) |
| 5 | undjudom 10227 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) | |
| 6 | 1, 4, 5 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) |
| 7 | infdjuabs 10264 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ⊔ 𝐵) ≈ 𝐴) | |
| 8 | domentr 9024 | . . 3 ⊢ (((𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵) ∧ (𝐴 ⊔ 𝐵) ≈ 𝐴) → (𝐴 ∪ 𝐵) ≼ 𝐴) | |
| 9 | 6, 7, 8 | syl2anc 596 | . 2 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ∪ 𝐵) ≼ 𝐴) |
| 10 | unexg 7749 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V) | |
| 11 | 1, 4, 10 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ∪ 𝐵) ∈ V) |
| 12 | ssun1 4124 | . . 3 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
| 13 | ssdomg 9011 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ V → (𝐴 ⊆ (𝐴 ∪ 𝐵) → 𝐴 ≼ (𝐴 ∪ 𝐵))) | |
| 14 | 11, 12, 13 | mpisyl 22 | . 2 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → 𝐴 ≼ (𝐴 ∪ 𝐵)) |
| 15 | sbth 9100 | . 2 ⊢ (((𝐴 ∪ 𝐵) ≼ 𝐴 ∧ 𝐴 ≼ (𝐴 ∪ 𝐵)) → (𝐴 ∪ 𝐵) ≈ 𝐴) | |
| 16 | 9, 14, 15 | syl2anc 596 | 1 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ∪ 𝐵) ≈ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 ∈ wcel 2145 Vcvv 3451 ∪ cun 3897 ⊆ wss 3899 class class class wbr 5103 dom cdm 5651 ωcom 7866 ≈ cen 8954 ≼ cdom 8955 ⊔ cdju 9960 cardccrd 9997 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-oi 9488 df-dju 9963 df-card 10001 |
| This theorem is used by: infunsdom1 10271 infxp 10273 |
| Copyright terms: Public domain | W3C validator |