Theorem disjen 9178

Description: A stronger form of pwuninel 8317. We can use pwuninel 8317, 2pwuninel 9176 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 8061	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
2	1	ad2antll 742	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
3		simprl 783	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 ∈ 𝐴)
4	2, 3	eqeltrrd 2865	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴)
5		fvex 6918	. . . . . . 7 ⊢ (1st ‘𝑥) ∈ V
6		fvex 6918	. . . . . . 7 ⊢ (2nd ‘𝑥) ∈ V
7	5, 6	opelrn 5931	. . . . . 6 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴 → (2nd ‘𝑥) ∈ ran 𝐴)
8	4, 7	syl 18	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ ran 𝐴)
9		pwuninel 8317	. . . . . 6 ⊢ ¬ 𝒫 ∪ ran 𝐴 ∈ ran 𝐴
10		xp2nd 8055	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
11	10	ad2antll 742	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
12		elsni 4601	. . . . . . . 8 ⊢ ((2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴} → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
13	11, 12	syl 18	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
14	13	eleq1d 2849	. . . . . 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 4096	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴})))
18	16, 17	sylnibr 332	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})))
19	18	eq0rdv 4368	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅)
20		simpr 490	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊)
21		rnexg 7935	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V)
22	21	adantr 486	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran 𝐴 ∈ V)
23		uniexg 7778	. . . 4 ⊢ (ran 𝐴 ∈ V → ∪ ran 𝐴 ∈ V)
24		pwexg 5344	. . . 4 ⊢ (∪ ran 𝐴 ∈ V → 𝒫 ∪ ran 𝐴 ∈ V)
25	22, 23, 24	3syl 19	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 ∪ ran 𝐴 ∈ V)
26		xpsneng 9106	. . 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 2147  Vcvv 3454   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ⟨cop 4838  ∪ cuni 4870   class class class wbr 5106   × cxp 5653  ran crn 5656  ‘cfv 6555  1^st c1st 8020  2^nd c2nd 8021   ≈ cen 8995

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 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-1st 8022  df-2nd 8023  df-en 8999

This theorem is used by:  disjenex  9179  domss2  9180