Theorem unen 8982

Description: Equinumerosity of union of disjoint sets. Theorem 4 of [Suppes] p. 92. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 26-Apr-2015.)

Assertion

Ref	Expression
unen	⊢ (((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))

Proof of Theorem unen

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bren 8893	. . 3 ⊢ (𝐴 ≈ 𝐵 ↔ ∃𝑥 𝑥:𝐴–1-1-onto→𝐵)
2		bren 8893	. . 3 ⊢ (𝐶 ≈ 𝐷 ↔ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷)
3		exdistrv 1956	. . . 4 ⊢ (∃𝑥∃𝑦(𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ↔ (∃𝑥 𝑥:𝐴–1-1-onto→𝐵 ∧ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷))
4		vex 3444	. . . . . . . 8 ⊢ 𝑥 ∈ V
5		vex 3444	. . . . . . . 8 ⊢ 𝑦 ∈ V
6	4, 5	unex 7689	. . . . . . 7 ⊢ (𝑥 ∪ 𝑦) ∈ V
7		f1oun 6793	. . . . . . 7 ⊢ (((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝑥 ∪ 𝑦):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷))
8		f1oen3g 8903	. . . . . . 7 ⊢ (((𝑥 ∪ 𝑦) ∈ V ∧ (𝑥 ∪ 𝑦):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))
9	6, 7, 8	sylancr 587	. . . . . 6 ⊢ (((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))
10	9	ex 412	. . . . 5 ⊢ ((𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)))
11	10	exlimivv 1933	. . . 4 ⊢ (∃𝑥∃𝑦(𝑥:𝐴–1-1-onto→𝐵 ∧ 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)))
12	3, 11	sylbir 235	. . 3 ⊢ ((∃𝑥 𝑥:𝐴–1-1-onto→𝐵 ∧ ∃𝑦 𝑦:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)))
13	1, 2, 12	syl2anb 598	. 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷)))
14	13	imp 406	1 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∪ 𝐶) ≈ (𝐵 ∪ 𝐷))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2113  Vcvv 3440   ∪ cun 3899   ∩ cin 3900  ∅c0 4285   class class class wbr 5098  –1-1-onto→wf1o 6491   ≈ 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-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  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-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  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-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-en 8884

This theorem is referenced by:  enrefnn  8983  difsnen  8987  limensuci  9081  infensuc  9083  pssnn  9093  unfi  9095  dif1ennnALT  9177  infdifsn  9566  pm54.43  9913  dif1card  9920  endjudisj  10079  djuen  10080  ssfin4  10220  fin23lem26  10235  unsnen  10463  fzennn  13891  mreexexlem4d  17570