MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  disjen Structured version   Visualization version   GIF version

Theorem disjen 9104
Description: A stronger form of pwuninel 8257. We can use pwuninel 8257, 2pwuninel 9102 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.
StepHypRef Expression
1 1st2nd2 8010 . . . . . . . 8 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
21ad2antll 729 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
3 simprl 770 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥𝐴)
42, 3eqeltrrd 2830 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴)
5 fvex 6874 . . . . . . 7 (1st𝑥) ∈ V
6 fvex 6874 . . . . . . 7 (2nd𝑥) ∈ V
75, 6opelrn 5910 . . . . . 6 (⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴 → (2nd𝑥) ∈ ran 𝐴)
84, 7syl 17 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ ran 𝐴)
9 pwuninel 8257 . . . . . 6 ¬ 𝒫 ran 𝐴 ∈ ran 𝐴
10 xp2nd 8004 . . . . . . . . 9 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
1110ad2antll 729 . . . . . . . 8 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
12 elsni 4609 . . . . . . . 8 ((2nd𝑥) ∈ {𝒫 ran 𝐴} → (2nd𝑥) = 𝒫 ran 𝐴)
1311, 12syl 17 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) = 𝒫 ran 𝐴)
1413eleq1d 2814 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ((2nd𝑥) ∈ ran 𝐴 ↔ 𝒫 ran 𝐴 ∈ ran 𝐴))
159, 14mtbiri 327 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ¬ (2nd𝑥) ∈ ran 𝐴)
168, 15pm2.65da 816 . . . 4 ((𝐴𝑉𝐵𝑊) → ¬ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
17 elin 3933 . . . 4 (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
1816, 17sylnibr 329 . . 3 ((𝐴𝑉𝐵𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})))
1918eq0rdv 4373 . 2 ((𝐴𝑉𝐵𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅)
20 simpr 484 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
21 rnexg 7881 . . . . 5 (𝐴𝑉 → ran 𝐴 ∈ V)
2221adantr 480 . . . 4 ((𝐴𝑉𝐵𝑊) → ran 𝐴 ∈ V)
23 uniexg 7719 . . . 4 (ran 𝐴 ∈ V → ran 𝐴 ∈ V)
24 pwexg 5336 . . . 4 ( ran 𝐴 ∈ V → 𝒫 ran 𝐴 ∈ V)
2522, 23, 243syl 18 . . 3 ((𝐴𝑉𝐵𝑊) → 𝒫 ran 𝐴 ∈ V)
26 xpsneng 9030 . . 3 ((𝐵𝑊 ∧ 𝒫 ran 𝐴 ∈ V) → (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)
2720, 25, 26syl2anc 584 . 2 ((𝐴𝑉𝐵𝑊) → (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)
2819, 27jca 511 1 ((𝐴𝑉𝐵𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3450  cin 3916  c0 4299  𝒫 cpw 4566  {csn 4592  cop 4598   cuni 4874   class class class wbr 5110   × cxp 5639  ran crn 5642  cfv 6514  1st c1st 7969  2nd c2nd 7970  cen 8918
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-1st 7971  df-2nd 7972  df-en 8922
This theorem is referenced by:  disjenex  9105  domss2  9106
  Copyright terms: Public domain W3C validator