Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  endisj Structured version   Visualization version   GIF version

Theorem endisj 8579
 Description: Any two sets are equinumerous to two disjoint sets. Exercise 4.39 of [Mendelson] p. 255. (Contributed by NM, 16-Apr-2004.)
Hypotheses
Ref Expression
endisj.1 𝐴 ∈ V
endisj.2 𝐵 ∈ V
Assertion
Ref Expression
endisj 𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem endisj
StepHypRef Expression
1 endisj.1 . . . 4 𝐴 ∈ V
2 0ex 5184 . . . 4 ∅ ∈ V
31, 2xpsnen 8576 . . 3 (𝐴 × {∅}) ≈ 𝐴
4 endisj.2 . . . 4 𝐵 ∈ V
5 1oex 8085 . . . 4 1o ∈ V
64, 5xpsnen 8576 . . 3 (𝐵 × {1o}) ≈ 𝐵
73, 6pm3.2i 474 . 2 ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵)
8 xp01disj 8095 . 2 ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅
9 p0ex 5258 . . . 4 {∅} ∈ V
101, 9xpex 7451 . . 3 (𝐴 × {∅}) ∈ V
11 snex 5305 . . . 4 {1o} ∈ V
124, 11xpex 7451 . . 3 (𝐵 × {1o}) ∈ V
13 breq1 5042 . . . . 5 (𝑥 = (𝐴 × {∅}) → (𝑥𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴))
14 breq1 5042 . . . . 5 (𝑦 = (𝐵 × {1o}) → (𝑦𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵))
1513, 14bi2anan9 638 . . . 4 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥𝐴𝑦𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵)))
16 ineq12 4159 . . . . 5 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o})))
1716eqeq1d 2823 . . . 4 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))
1815, 17anbi12d 633 . . 3 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)))
1910, 12, 18spc2ev 3585 . 2 ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅))
207, 8, 19mp2an 691 1 𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅)
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 399   = wceq 1538  ∃wex 1781   ∈ wcel 2115  Vcvv 3471   ∩ cin 3909  ∅c0 4266  {csn 4540   class class class wbr 5039   × cxp 5526  1oc1o 8070   ≈ cen 8481 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-sbc 3750  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-tp 4545  df-op 4547  df-uni 4812  df-int 4850  df-br 5040  df-opab 5102  df-mpt 5120  df-tr 5146  df-id 5433  df-eprel 5438  df-po 5447  df-so 5448  df-fr 5487  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-ord 6167  df-on 6168  df-suc 6170  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-1o 8077  df-en 8485 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator