| 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 4239 | . . . 4 ⊢ ∅ ∈ V | |
| 3 | 1, 2 | xpsnen 7074 | . . 3 ⊢ (𝐴 × {∅}) ≈ 𝐴 |
| 4 | endisj.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 5 | 1on 6656 | . . . . 5 ⊢ 1o ∈ On | |
| 6 | 5 | elexi 2828 | . . . 4 ⊢ 1o ∈ V |
| 7 | 4, 6 | xpsnen 7074 | . . 3 ⊢ (𝐵 × {1o}) ≈ 𝐵 |
| 8 | 3, 7 | pm3.2i 272 | . 2 ⊢ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) |
| 9 | xp01disj 6668 | . 2 ⊢ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅ | |
| 10 | p0ex 4303 | . . . 4 ⊢ {∅} ∈ V | |
| 11 | 1, 10 | xpex 4868 | . . 3 ⊢ (𝐴 × {∅}) ∈ V |
| 12 | 6 | snex 4300 | . . . 4 ⊢ {1o} ∈ V |
| 13 | 4, 12 | xpex 4868 | . . 3 ⊢ (𝐵 × {1o}) ∈ V |
| 14 | breq1 4114 | . . . . 5 ⊢ (𝑥 = (𝐴 × {∅}) → (𝑥 ≈ 𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴)) | |
| 15 | breq1 4114 | . . . . 5 ⊢ (𝑦 = (𝐵 × {1o}) → (𝑦 ≈ 𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵)) | |
| 16 | 14, 15 | bi2anan9 610 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵))) |
| 17 | ineq12 3419 | . . . . 5 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥 ∩ 𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o}))) | |
| 18 | 17 | eqeq1d 2243 | . . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)) |
| 19 | 16, 18 | anbi12d 473 | . . 3 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))) |
| 20 | 11, 13, 19 | spc2ev 2915 | . 2 ⊢ ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅)) |
| 21 | 8, 9, 20 | mp2an 426 | 1 ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1398 ∃wex 1541 ∈ wcel 2205 Vcvv 2815 ∩ cin 3212 ∅c0 3510 {csn 3691 class class class wbr 4111 Oncon0 4486 × cxp 4749 1oc1o 6642 ≈ cen 6975 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-v 2817 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-suc 4494 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-1o 6649 df-en 6978 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |