| 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 8962 | . . . . . 6 ⊢ Rel ≼ | |
| 3 | 2 | brrelex1i 5715 | . . . . 5 ⊢ (𝐵 ≼ 𝐴 → 𝐵 ∈ V) |
| 4 | 3 | 3ad2ant3 1153 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ V) |
| 5 | undjudom 10174 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) | |
| 6 | 1, 4, 5 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) |
| 7 | infdjuabs 10211 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → (𝐴 ⊔ 𝐵) ≈ 𝐴) | |
| 8 | domentr 9023 | . . 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 4127 | . . 3 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
| 13 | ssdomg 9010 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ V → (𝐴 ⊆ (𝐴 ∪ 𝐵) → 𝐴 ≼ (𝐴 ∪ 𝐵))) | |
| 14 | 11, 12, 13 | mpisyl 22 | . 2 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴) → 𝐴 ≼ (𝐴 ∪ 𝐵)) |
| 15 | sbth 9099 | . 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 3453 ∪ cun 3900 ⊆ wss 3902 class class class wbr 5107 dom cdm 5659 ωcom 7866 ≈ cen 8953 ≼ cdom 8954 ⊔ cdju 9907 cardccrd 9944 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7374 df-ov 7420 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-oi 9486 df-dju 9910 df-card 9948 |
| This theorem is used by: infunsdom1 10218 infxp 10220 |
| Copyright terms: Public domain | W3C validator |