![]() |
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 4013 | . . . 4 ⊢ ∅ ∈ V | |
3 | 1, 2 | xpsnen 6666 | . . 3 ⊢ (𝐴 × {∅}) ≈ 𝐴 |
4 | endisj.2 | . . . 4 ⊢ 𝐵 ∈ V | |
5 | 1on 6272 | . . . . 5 ⊢ 1o ∈ On | |
6 | 5 | elexi 2667 | . . . 4 ⊢ 1o ∈ V |
7 | 4, 6 | xpsnen 6666 | . . 3 ⊢ (𝐵 × {1o}) ≈ 𝐵 |
8 | 3, 7 | pm3.2i 268 | . 2 ⊢ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) |
9 | xp01disj 6282 | . 2 ⊢ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅ | |
10 | p0ex 4070 | . . . 4 ⊢ {∅} ∈ V | |
11 | 1, 10 | xpex 4612 | . . 3 ⊢ (𝐴 × {∅}) ∈ V |
12 | 6 | snex 4067 | . . . 4 ⊢ {1o} ∈ V |
13 | 4, 12 | xpex 4612 | . . 3 ⊢ (𝐵 × {1o}) ∈ V |
14 | breq1 3896 | . . . . 5 ⊢ (𝑥 = (𝐴 × {∅}) → (𝑥 ≈ 𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴)) | |
15 | breq1 3896 | . . . . 5 ⊢ (𝑦 = (𝐵 × {1o}) → (𝑦 ≈ 𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵)) | |
16 | 14, 15 | bi2anan9 578 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵))) |
17 | ineq12 3236 | . . . . 5 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥 ∩ 𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o}))) | |
18 | 17 | eqeq1d 2121 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)) |
19 | 16, 18 | anbi12d 462 | . . 3 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))) |
20 | 11, 13, 19 | spc2ev 2750 | . 2 ⊢ ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅)) |
21 | 8, 9, 20 | mp2an 420 | 1 ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1312 ∃wex 1449 ∈ wcel 1461 Vcvv 2655 ∩ cin 3034 ∅c0 3327 {csn 3491 class class class wbr 3893 Oncon0 4243 × cxp 4495 1oc1o 6258 ≈ cen 6584 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 586 ax-in2 587 ax-io 681 ax-5 1404 ax-7 1405 ax-gen 1406 ax-ie1 1450 ax-ie2 1451 ax-8 1463 ax-10 1464 ax-11 1465 ax-i12 1466 ax-bndl 1467 ax-4 1468 ax-13 1472 ax-14 1473 ax-17 1487 ax-i9 1491 ax-ial 1495 ax-i5r 1496 ax-ext 2095 ax-sep 4004 ax-nul 4012 ax-pow 4056 ax-pr 4089 ax-un 4313 |
This theorem depends on definitions: df-bi 116 df-3an 945 df-tru 1315 df-fal 1318 df-nf 1418 df-sb 1717 df-eu 1976 df-mo 1977 df-clab 2100 df-cleq 2106 df-clel 2109 df-nfc 2242 df-ne 2281 df-ral 2393 df-rex 2394 df-v 2657 df-dif 3037 df-un 3039 df-in 3041 df-ss 3048 df-nul 3328 df-pw 3476 df-sn 3497 df-pr 3498 df-op 3500 df-uni 3701 df-int 3736 df-br 3894 df-opab 3948 df-mpt 3949 df-tr 3985 df-id 4173 df-iord 4246 df-on 4248 df-suc 4251 df-xp 4503 df-rel 4504 df-cnv 4505 df-co 4506 df-dm 4507 df-rn 4508 df-fun 5081 df-fn 5082 df-f 5083 df-f1 5084 df-fo 5085 df-f1o 5086 df-1o 6265 df-en 6587 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |