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

Theorem endisj 8992
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 5252 . . . 4 ∅ ∈ V
31, 2xpsnen 8989 . . 3 (𝐴 × {∅}) ≈ 𝐴
4 endisj.2 . . . 4 𝐵 ∈ V
5 1oex 8407 . . . 4 1o ∈ V
64, 5xpsnen 8989 . . 3 (𝐵 × {1o}) ≈ 𝐵
73, 6pm3.2i 470 . 2 ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵)
8 xp01disj 8418 . 2 ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅
9 p0ex 5329 . . . 4 {∅} ∈ V
101, 9xpex 7698 . . 3 (𝐴 × {∅}) ∈ V
11 snex 5381 . . . 4 {1o} ∈ V
124, 11xpex 7698 . . 3 (𝐵 × {1o}) ∈ V
13 breq1 5101 . . . . 5 (𝑥 = (𝐴 × {∅}) → (𝑥𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴))
14 breq1 5101 . . . . 5 (𝑦 = (𝐵 × {1o}) → (𝑦𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵))
1513, 14bi2anan9 638 . . . 4 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥𝐴𝑦𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵)))
16 ineq12 4167 . . . . 5 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o})))
1716eqeq1d 2738 . . . 4 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))
1815, 17anbi12d 632 . . 3 ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)))
1910, 12, 18spc2ev 3561 . 2 ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅))
207, 8, 19mp2an 692 1 𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑥𝑦) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  wex 1780  wcel 2113  Vcvv 3440  cin 3900  c0 4285  {csn 4580   class class class wbr 5098   × cxp 5622  1oc1o 8390  cen 8880
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-suc 6323  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-1o 8397  df-en 8884
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator