Theorem disjen 9153

Description: A stronger form of pwuninel 8292. We can use pwuninel 8292, 2pwuninel 9151 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 8040	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
2	1	ad2antll 742	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
3		simprl 783	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → 𝑥 ∈ 𝐴)
4	2, 3	eqeltrrd 2861	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴)
5		fvex 6898	. . . . . . 7 ⊢ (1st ‘𝑥) ∈ V
6		fvex 6898	. . . . . . 7 ⊢ (2nd ‘𝑥) ∈ V
7	5, 6	opelrn 5924	. . . . . 6 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ 𝐴 → (2nd ‘𝑥) ∈ ran 𝐴)
8	4, 7	syl 18	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ ran 𝐴)
9		pwuninel 8292	. . . . . 6 ⊢ ¬ 𝒫 ∪ ran 𝐴 ∈ ran 𝐴
10		xp2nd 8034	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
11	10	ad2antll 742	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴})
12		elsni 4600	. . . . . . . 8 ⊢ ((2nd ‘𝑥) ∈ {𝒫 ∪ ran 𝐴} → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
13	11, 12	syl 18	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴}))) → (2nd ‘𝑥) = 𝒫 ∪ ran 𝐴)
14	13	eleq1d 2845	. . . . . 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 4093	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × {𝒫 ∪ ran 𝐴})))
18	16, 17	sylnibr 332	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})))
19	18	eq0rdv 4364	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅)
20		simpr 490	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊)
21		rnexg 7914	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V)
22	21	adantr 486	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ran 𝐴 ∈ V)
23		uniexg 7757	. . . 4 ⊢ (ran 𝐴 ∈ V → ∪ ran 𝐴 ∈ V)
24		pwexg 5339	. . . 4 ⊢ (∪ ran 𝐴 ∈ V → 𝒫 ∪ ran 𝐴 ∈ V)
25	22, 23, 24	3syl 19	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 ∪ ran 𝐴 ∈ V)
26		xpsneng 9081	. . 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 1569   ∈ wcel 2144  Vcvv 3450   ∩ cin 4089  ∅c0 4278  𝒫 cpw 4556  {csn 4583  ⟨cop 4589  ∪ cuni 4866   class class class wbr 5102   × cxp 5648  ran crn 5651  ‘cfv 6538  1^st c1st 7999  2^nd c2nd 8000   ≈ cen 8970

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-1st 8001  df-2nd 8002  df-en 8974

This theorem is used by:  disjenex  9154  domss2  9155