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 5226 | . . . 4 ⊢ ∅ ∈ V | |
3 | 1, 2 | xpsnen 8796 | . . 3 ⊢ (𝐴 × {∅}) ≈ 𝐴 |
4 | endisj.2 | . . . 4 ⊢ 𝐵 ∈ V | |
5 | 1oex 8280 | . . . 4 ⊢ 1o ∈ V | |
6 | 4, 5 | xpsnen 8796 | . . 3 ⊢ (𝐵 × {1o}) ≈ 𝐵 |
7 | 3, 6 | pm3.2i 470 | . 2 ⊢ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) |
8 | xp01disj 8287 | . 2 ⊢ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅ | |
9 | p0ex 5302 | . . . 4 ⊢ {∅} ∈ V | |
10 | 1, 9 | xpex 7581 | . . 3 ⊢ (𝐴 × {∅}) ∈ V |
11 | snex 5349 | . . . 4 ⊢ {1o} ∈ V | |
12 | 4, 11 | xpex 7581 | . . 3 ⊢ (𝐵 × {1o}) ∈ V |
13 | breq1 5073 | . . . . 5 ⊢ (𝑥 = (𝐴 × {∅}) → (𝑥 ≈ 𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴)) | |
14 | breq1 5073 | . . . . 5 ⊢ (𝑦 = (𝐵 × {1o}) → (𝑦 ≈ 𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵)) | |
15 | 13, 14 | bi2anan9 635 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵))) |
16 | ineq12 4138 | . . . . 5 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥 ∩ 𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o}))) | |
17 | 16 | eqeq1d 2740 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)) |
18 | 15, 17 | anbi12d 630 | . . 3 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))) |
19 | 10, 12, 18 | spc2ev 3536 | . 2 ⊢ ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅)) |
20 | 7, 8, 19 | mp2an 688 | 1 ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 Vcvv 3422 ∩ cin 3882 ∅c0 4253 {csn 4558 class class class wbr 5070 × cxp 5578 1oc1o 8260 ≈ cen 8688 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-int 4877 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-suc 6257 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-1o 8267 df-en 8692 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |