Theorem endisj 9121

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

Step	Hyp	Ref	Expression
1		endisj.1	. . . 4 ⊢ 𝐴 ∈ V
2		0ex 5267	. . . 4 ⊢ ∅ ∈ V
3	1, 2	xpsnen 9118	. . 3 ⊢ (𝐴 × {∅}) ≈ 𝐴
4		endisj.2	. . . 4 ⊢ 𝐵 ∈ V
5		1oex 8524	. . . 4 ⊢ 1o ∈ V
6	4, 5	xpsnen 9118	. . 3 ⊢ (𝐵 × {1o}) ≈ 𝐵
7	3, 6	pm3.2i 476	. 2 ⊢ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵)
8		xp01disj 8537	. 2 ⊢ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅
9		p0ex 5353	. . . 4 ⊢ {∅} ∈ V
10	1, 9	xpex 7799	. . 3 ⊢ (𝐴 × {∅}) ∈ V
11		snex 5404	. . . 4 ⊢ {1o} ∈ V
12	4, 11	xpex 7799	. . 3 ⊢ (𝐵 × {1o}) ∈ V
13		breq1 5111	. . . . 5 ⊢ (𝑥 = (𝐴 × {∅}) → (𝑥 ≈ 𝐴 ↔ (𝐴 × {∅}) ≈ 𝐴))
14		breq1 5111	. . . . 5 ⊢ (𝑦 = (𝐵 × {1o}) → (𝑦 ≈ 𝐵 ↔ (𝐵 × {1o}) ≈ 𝐵))
15	13, 14	bi2anan9 650	. . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ ((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵)))
16		ineq12 4115	. . . . 5 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (𝑥 ∩ 𝑦) = ((𝐴 × {∅}) ∩ (𝐵 × {1o})))
17	16	eqeq1d 2765	. . . 4 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → ((𝑥 ∩ 𝑦) = ∅ ↔ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅))
18	15, 17	anbi12d 644	. . 3 ⊢ ((𝑥 = (𝐴 × {∅}) ∧ 𝑦 = (𝐵 × {1o})) → (((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅) ↔ (((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅)))
19	10, 12, 18	spc2ev 3565	. 2 ⊢ ((((𝐴 × {∅}) ≈ 𝐴 ∧ (𝐵 × {1o}) ≈ 𝐵) ∧ ((𝐴 × {∅}) ∩ (𝐵 × {1o})) = ∅) → ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅))
20	7, 8, 19	mp2an 705	1 ⊢ ∃𝑥∃𝑦((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ∧ (𝑥 ∩ 𝑦) = ∅)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092  ∅c0 4281  {csn 4588   class class class wbr 5108   × cxp 5656  1_oc1o 8507   ≈ cen 9008

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-suc 6394  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-1o 8514  df-en 9012

This theorem is used by: (None)