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

Theorem disjen 9060
Description: A stronger form of pwuninel 8215. We can use pwuninel 8215, 2pwuninel 9058 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 7970 . . . . . . . 8 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
21ad2antll 729 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
3 simprl 770 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥𝐴)
42, 3eqeltrrd 2835 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴)
5 fvex 6845 . . . . . . 7 (1st𝑥) ∈ V
6 fvex 6845 . . . . . . 7 (2nd𝑥) ∈ V
75, 6opelrn 5890 . . . . . 6 (⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴 → (2nd𝑥) ∈ ran 𝐴)
84, 7syl 17 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ ran 𝐴)
9 pwuninel 8215 . . . . . 6 ¬ 𝒫 ran 𝐴 ∈ ran 𝐴
10 xp2nd 7964 . . . . . . . . 9 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
1110ad2antll 729 . . . . . . . 8 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
12 elsni 4595 . . . . . . . 8 ((2nd𝑥) ∈ {𝒫 ran 𝐴} → (2nd𝑥) = 𝒫 ran 𝐴)
1311, 12syl 17 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) = 𝒫 ran 𝐴)
1413eleq1d 2819 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ((2nd𝑥) ∈ ran 𝐴 ↔ 𝒫 ran 𝐴 ∈ ran 𝐴))
159, 14mtbiri 327 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ¬ (2nd𝑥) ∈ ran 𝐴)
168, 15pm2.65da 816 . . . 4 ((𝐴𝑉𝐵𝑊) → ¬ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
17 elin 3915 . . . 4 (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
1816, 17sylnibr 329 . . 3 ((𝐴𝑉𝐵𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})))
1918eq0rdv 4357 . 2 ((𝐴𝑉𝐵𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅)
20 simpr 484 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
21 rnexg 7842 . . . . 5 (𝐴𝑉 → ran 𝐴 ∈ V)
2221adantr 480 . . . 4 ((𝐴𝑉𝐵𝑊) → ran 𝐴 ∈ V)
23 uniexg 7683 . . . 4 (ran 𝐴 ∈ V → ran 𝐴 ∈ V)
24 pwexg 5321 . . . 4 ( ran 𝐴 ∈ V → 𝒫 ran 𝐴 ∈ V)
2522, 23, 243syl 18 . . 3 ((𝐴𝑉𝐵𝑊) → 𝒫 ran 𝐴 ∈ V)
26 xpsneng 8988 . . 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 1541  wcel 2113  Vcvv 3438  cin 3898  c0 4283  𝒫 cpw 4552  {csn 4578  cop 4584   cuni 4861   class class class wbr 5096   × cxp 5620  ran crn 5623  cfv 6490  1st c1st 7929  2nd c2nd 7930  cen 8878
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-1st 7931  df-2nd 7932  df-en 8882
This theorem is referenced by:  disjenex  9061  domss2  9062
  Copyright terms: Public domain W3C validator