| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unen | Structured version Visualization version GIF version | ||
| Description: Equinumerosity of union of disjoint sets. Theorem 4 of [Suppes] p. 92. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| unen | ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bren 8967 | . . 3 ⊢ (𝐴 ≈ 𝐵 ↔ ∃𝑥 𝑥:𝐴–1-1-onto→𝐵) | |
| 2 | bren 8967 | . . 3 ⊢ (𝐶 ≈ 𝐷 ↔ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷) | |
| 3 | exdistrv 1988 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ↔ (∃𝑥 𝑥:𝐴–1-1-onto→𝐵 ∧ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷)) | |
| 4 | vex 3455 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 5 | vex 3455 | . . . . . . . 8 ⊢ 𝑦 ∈ V | |
| 6 | 4, 5 | unex 7750 | . . . . . . 7 ⊢ (𝑥 ∪ 𝑦) ∈ V |
| 7 | f1oun 6836 | . . . . . . 7 ⊢ (((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝑥 ∪ 𝑦):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷)) | |
| 8 | f1oen3g 8977 | . . . . . . 7 ⊢ (((𝑥 ∪ 𝑦) ∈ V ∧ (𝑥 ∪ 𝑦):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) | |
| 9 | 6, 7, 8 | sylancr 599 | . . . . . 6 ⊢ (((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) |
| 10 | 9 | ex 418 | . . . . 5 ⊢ ((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 11 | 10 | exlimivv 1965 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 12 | 3, 11 | sylbir 238 | . . 3 ⊢ ((∃𝑥 𝑥:𝐴–1-1-onto→𝐵 ∧ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 13 | 1, 2, 12 | syl2anb 610 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 14 | 13 | imp 412 | 1 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 Vcvv 3451 ∪ cun 3897 ∩ cin 3898 ∅c0 4279 class class class wbr 5103 –1-1-onto→wf1o 6530 ≈ cen 8954 |
| 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-12 2213 ax-ext 2733 ax-sep 5249 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-en 8958 |
| This theorem is used by: enrefnn 9058 difsnen 9062 limensuci 9156 infensuc 9158 pssnn 9168 unfi 9170 dif1ennnALT 9252 infdifsn 9642 pm54.43 10063 dif1card 10070 endjudisj 10228 djuen 10229 ssfin4 10369 fin23lem26 10384 unsnen 10618 fzennn 14091 mreexexlem4d 17801 |
| Copyright terms: Public domain | W3C validator |