| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > endisj | Structured version Visualization version GIF version | ||
| Description: Any two sets are equinumerous to two disjoint sets. Exercise 4.39 of [Mendelson] p. 255. (Contributed by NM, 16-Apr-2004.) |
| Ref | Expression |
|---|---|
| endisj.1 | ⊢ 𝐴 ∈ V |
| endisj.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| endisj | ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | endisj.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | 0ex 5271 | . . . 4 ⊢ ∅ ∈ V | |
| 3 | 1, 2 | xpsnen 9050 | . . 3 ⊢ (𝐴 × {∅}) ≈ 𝐴 |
| 4 | endisj.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 5 | 1oex 8464 | . . . 4 ⊢ 1o ∈ V | |
| 6 | 4, 5 | xpsnen 9050 | . . 3 ⊢ (𝐵 × {1o}) ≈ 𝐵 |
| 7 | 3, 6 | pm3.2i 475 | . 2 ⊢ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) |
| 8 | xp01disj 8477 | . 2 ⊢ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅ | |
| 9 | p0ex 5357 | . . . 4 ⊢ {∅} ∈ V | |
| 10 | 1, 9 | xpex 7753 | . . 3 ⊢ (𝐴 × {∅}) ∈ V |
| 11 | snex 5412 | . . . 4 ⊢ {1o} ∈ V | |
| 12 | 4, 11 | xpex 7753 | . . 3 ⊢ (𝐵 × {1o}) ∈ V |
| 13 | breq1 5113 | . . . . 5 ⊢ (𝑥 = (𝐴 × {∅}) → (𝑥 ≈ 𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴)) | |
| 14 | breq1 5113 | . . . . 5 ⊢ (𝑦 = (𝐵 × {1o}) → (𝑦 ≈ 𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵)) | |
| 15 | 13, 14 | bi2anan9 649 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵))) |
| 16 | ineq12 4169 | . . . . 5 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥 ∩ 𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o}))) | |
| 17 | 16 | eqeq1d 2765 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)) |
| 18 | 15, 17 | anbi12d 643 | . . 3 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))) |
| 19 | 10, 12, 18 | spc2ev 3567 | . 2 ⊢ ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅)) |
| 20 | 7, 8, 19 | mp2an 704 | 1 ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 = wceq 1570 ∃wex 1809 ∈ wcel 2143 Vcvv 3455 ∩ cin 3905 ∅c0 4287 {csn 4590 class class class wbr 5110 × cxp 5661 1oc1o 8447 ≈ cen 8941 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-suc 6368 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-1o 8454 df-en 8945 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |