Theorem disjen 9118

Description: A stronger form of pwuninel 8267. We can use pwuninel 8267, 2pwuninel 9116 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 8021	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
2	1	ad2antll 741	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
3		simprl 782	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 ∈ 𝐴)
4	2, 3	eqeltrrd 2864	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴)
5		fvex 6894	. . . . . . 7 ⊢ (1st ‘𝑥) ∈ V
6		fvex 6894	. . . . . . 7 ⊢ (2nd ‘𝑥) ∈ V
7	5, 6	opelrn 5933	. . . . . 6 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴 → (2nd ‘𝑥) ∈ ran 𝐴)
8	4, 7	syl 18	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ ran 𝐴)
9		pwuninel 8267	. . . . . 6 ⊢ ¬ 𝒫 ∪ ran 𝐴 ∈ ran 𝐴
10		xp2nd 8015	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
11	10	ad2antll 741	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
12		elsni 4606	. . . . . . . 8 ⊢ ((2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴} → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
13	11, 12	syl 18	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
14	13	eleq1d 2848	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ((2nd ‘𝑥) ∈ ran 𝐴 ↔ 𝒫 ∪ ran 𝐴 ∈ ran 𝐴))
15	9, 14	mtbiri 330	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ¬ (2nd ‘𝑥) ∈ ran 𝐴)
16	8, 15	pm2.65da 828	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ¬ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴})))
17		elin 3921	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴})))
18	16, 17	sylnibr 332	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})))
19	18	eq0rdv 4372	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅)
20		simpr 489	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊)
21		rnexg 7895	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V)
22	21	adantr 485	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran 𝐴 ∈ V)
23		uniexg 7738	. . . 4 ⊢ (ran 𝐴 ∈ V → ∪ ran 𝐴 ∈ V)
24		pwexg 5349	. . . 4 ⊢ (∪ ran 𝐴 ∈ V → 𝒫 ∪ ran 𝐴 ∈ V)
25	22, 23, 24	3syl 19	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 ∪ ran 𝐴 ∈ V)
26		xpsneng 9046	. . 3 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝒫 ∪ ran 𝐴 ∈ V) → (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)
27	20, 25, 26	syl2anc 595	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)
28	19, 27	jca 520	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ∩ cin 3904  ∅c0 4286  𝒫 cpw 4562  {csn 4589  ⟨cop 4595  ∪ cuni 4872   class class class wbr 5109   × cxp 5659  ran crn 5662  ‘cfv 6536  1^st c1st 7980  2^nd c2nd 7981   ≈ cen 8936

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-1st 7982  df-2nd 7983  df-en 8940

This theorem is used by:  disjenex  9119  domss2  9120