| 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 8928 | . . 3 ⊢ (𝐴 ≈ 𝐵 ↔ ∃𝑥 𝑥:𝐴–1-1-onto→𝐵) | |
| 2 | bren 8928 | . . 3 ⊢ (𝐶 ≈ 𝐷 ↔ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷) | |
| 3 | exdistrv 1955 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ↔ (∃𝑥 𝑥:𝐴–1-1-onto→𝐵 ∧ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷)) | |
| 4 | vex 3451 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 5 | vex 3451 | . . . . . . . 8 ⊢ 𝑦 ∈ V | |
| 6 | 4, 5 | unex 7720 | . . . . . . 7 ⊢ (𝑥 ∪ 𝑦) ∈ V |
| 7 | f1oun 6819 | . . . . . . 7 ⊢ (((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝑥 ∪ 𝑦):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷)) | |
| 8 | f1oen3g 8938 | . . . . . . 7 ⊢ (((𝑥 ∪ 𝑦) ∈ V ∧ (𝑥 ∪ 𝑦):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) | |
| 9 | 6, 7, 8 | sylancr 587 | . . . . . 6 ⊢ (((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) |
| 10 | 9 | ex 412 | . . . . 5 ⊢ ((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 11 | 10 | exlimivv 1932 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 12 | 3, 11 | sylbir 235 | . . 3 ⊢ ((∃𝑥 𝑥:𝐴–1-1-onto→𝐵 ∧ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 13 | 1, 2, 12 | syl2anb 598 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))) |
| 14 | 13 | imp 406 | 1 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2109 Vcvv 3447 ∪ cun 3912 ∩ cin 3913 ∅c0 4296 class class class wbr 5107 –1-1-onto→wf1o 6510 ≈ cen 8915 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-en 8919 |
| This theorem is referenced by: enrefnn 9018 enpr2dOLD 9021 difsnen 9023 limensuci 9117 infensuc 9119 pssnn 9132 unfi 9135 dif1ennnALT 9222 infdifsn 9610 pm54.43 9954 dif1card 9963 endjudisj 10122 djuen 10123 ssfin4 10263 fin23lem26 10278 unsnen 10506 fzennn 13933 mreexexlem4d 17608 |
| Copyright terms: Public domain | W3C validator |