![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > endisj | GIF version |
Description: Any two sets are equinumerous to 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 4157 | . . . 4 ⊢ ∅ ∈ V | |
3 | 1, 2 | xpsnen 6877 | . . 3 ⊢ (𝐴 × {∅}) ≈ 𝐴 |
4 | endisj.2 | . . . 4 ⊢ 𝐵 ∈ V | |
5 | 1on 6478 | . . . . 5 ⊢ 1o ∈ On | |
6 | 5 | elexi 2772 | . . . 4 ⊢ 1o ∈ V |
7 | 4, 6 | xpsnen 6877 | . . 3 ⊢ (𝐵 × {1o}) ≈ 𝐵 |
8 | 3, 7 | pm3.2i 272 | . 2 ⊢ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) |
9 | xp01disj 6488 | . 2 ⊢ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅ | |
10 | p0ex 4218 | . . . 4 ⊢ {∅} ∈ V | |
11 | 1, 10 | xpex 4775 | . . 3 ⊢ (𝐴 × {∅}) ∈ V |
12 | 6 | snex 4215 | . . . 4 ⊢ {1o} ∈ V |
13 | 4, 12 | xpex 4775 | . . 3 ⊢ (𝐵 × {1o}) ∈ V |
14 | breq1 4033 | . . . . 5 ⊢ (𝑥 = (𝐴 × {∅}) → (𝑥 ≈ 𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴)) | |
15 | breq1 4033 | . . . . 5 ⊢ (𝑦 = (𝐵 × {1o}) → (𝑦 ≈ 𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵)) | |
16 | 14, 15 | bi2anan9 606 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵))) |
17 | ineq12 3356 | . . . . 5 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥 ∩ 𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o}))) | |
18 | 17 | eqeq1d 2202 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)) |
19 | 16, 18 | anbi12d 473 | . . 3 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))) |
20 | 11, 13, 19 | spc2ev 2857 | . 2 ⊢ ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅)) |
21 | 8, 9, 20 | mp2an 426 | 1 ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 = wceq 1364 ∃wex 1503 ∈ wcel 2164 Vcvv 2760 ∩ cin 3153 ∅c0 3447 {csn 3619 class class class wbr 4030 Oncon0 4395 × cxp 4658 1oc1o 6464 ≈ cen 6794 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-v 2762 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-iord 4398 df-on 4400 df-suc 4403 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-1o 6471 df-en 6797 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |