Theorem disjen 9129

Description: A stronger form of pwuninel 8277. We can use pwuninel 8277, 2pwuninel 9127 to create one or two sets disjoint from a given set 𝐴, but here we show that in fact such constructions exist for arbitrarily large disjoint extensions, which is to say that for any set 𝐵 we can construct a set 𝑥 that is equinumerous to it and disjoint from 𝐴. (Contributed by Mario Carneiro, 7-Feb-2015.)

Assertion

Ref	Expression
disjen	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵))

Proof of Theorem disjen

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		1st2nd2 8031	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
2	1	ad2antll 742	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
3		simprl 783	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 ∈ 𝐴)
4	2, 3	eqeltrrd 2866	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴)
5		fvex 6898	. . . . . . 7 ⊢ (1st ‘𝑥) ∈ V
6		fvex 6898	. . . . . . 7 ⊢ (2nd ‘𝑥) ∈ V
7	5, 6	opelrn 5935	. . . . . 6 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴 → (2nd ‘𝑥) ∈ ran 𝐴)
8	4, 7	syl 18	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ ran 𝐴)
9		pwuninel 8277	. . . . . 6 ⊢ ¬ 𝒫 ∪ ran 𝐴 ∈ ran 𝐴
10		xp2nd 8025	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
11	10	ad2antll 742	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
12		elsni 4608	. . . . . . . 8 ⊢ ((2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴} → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
13	11, 12	syl 18	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
14	13	eleq1d 2850	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ((2nd ‘𝑥) ∈ ran 𝐴 ↔ 𝒫 ∪ ran 𝐴 ∈ ran 𝐴))
15	9, 14	mtbiri 330	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ¬ (2nd ‘𝑥) ∈ ran 𝐴)
16	8, 15	pm2.65da 829	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ¬ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴})))
17		elin 3922	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴})))
18	16, 17	sylnibr 332	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})))
19	18	eq0rdv 4372	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅)
20		simpr 490	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊)
21		rnexg 7905	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V)
22	21	adantr 486	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran 𝐴 ∈ V)
23		uniexg 7748	. . . 4 ⊢ (ran 𝐴 ∈ V → ∪ ran 𝐴 ∈ V)
24		pwexg 5351	. . . 4 ⊢ (∪ ran 𝐴 ∈ V → 𝒫 ∪ ran 𝐴 ∈ V)
25	22, 23, 24	3syl 19	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 ∪ ran 𝐴 ∈ V)
26		xpsneng 9057	. . 3 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝒫 ∪ ran 𝐴 ∈ V) → (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)
27	20, 25, 26	syl2anc 596	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)
28	19, 27	jca 521	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457   ∩ cin 3905  ∅c0 4286  𝒫 cpw 4564  {csn 4591  ⟨cop 4597  ∪ cuni 4874   class class class wbr 5111   × cxp 5661  ran crn 5664  ‘cfv 6540  1^st c1st 7990  2^nd c2nd 7991   ≈ cen 8946

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-1st 7992  df-2nd 7993  df-en 8950

This theorem is used by:  disjenex  9130  domss2  9131