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

Theorem disjen 8870
Description: A stronger form of pwuninel 8062. We can use pwuninel 8062, 2pwuninel 8868 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 7843 . . . . . . . 8 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
21ad2antll 725 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
3 simprl 767 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥𝐴)
42, 3eqeltrrd 2840 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴)
5 fvex 6769 . . . . . . 7 (1st𝑥) ∈ V
6 fvex 6769 . . . . . . 7 (2nd𝑥) ∈ V
75, 6opelrn 5841 . . . . . 6 (⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴 → (2nd𝑥) ∈ ran 𝐴)
84, 7syl 17 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ ran 𝐴)
9 pwuninel 8062 . . . . . 6 ¬ 𝒫 ran 𝐴 ∈ ran 𝐴
10 xp2nd 7837 . . . . . . . . 9 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
1110ad2antll 725 . . . . . . . 8 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
12 elsni 4575 . . . . . . . 8 ((2nd𝑥) ∈ {𝒫 ran 𝐴} → (2nd𝑥) = 𝒫 ran 𝐴)
1311, 12syl 17 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) = 𝒫 ran 𝐴)
1413eleq1d 2823 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ((2nd𝑥) ∈ ran 𝐴 ↔ 𝒫 ran 𝐴 ∈ ran 𝐴))
159, 14mtbiri 326 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ¬ (2nd𝑥) ∈ ran 𝐴)
168, 15pm2.65da 813 . . . 4 ((𝐴𝑉𝐵𝑊) → ¬ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
17 elin 3899 . . . 4 (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
1816, 17sylnibr 328 . . 3 ((𝐴𝑉𝐵𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})))
1918eq0rdv 4335 . 2 ((𝐴𝑉𝐵𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅)
20 simpr 484 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
21 rnexg 7725 . . . . 5 (𝐴𝑉 → ran 𝐴 ∈ V)
2221adantr 480 . . . 4 ((𝐴𝑉𝐵𝑊) → ran 𝐴 ∈ V)
23 uniexg 7571 . . . 4 (ran 𝐴 ∈ V → ran 𝐴 ∈ V)
24 pwexg 5296 . . . 4 ( ran 𝐴 ∈ V → 𝒫 ran 𝐴 ∈ V)
2522, 23, 243syl 18 . . 3 ((𝐴𝑉𝐵𝑊) → 𝒫 ran 𝐴 ∈ V)
26 xpsneng 8797 . . 3 ((𝐵𝑊 ∧ 𝒫 ran 𝐴 ∈ V) → (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)
2720, 25, 26syl2anc 583 . 2 ((𝐴𝑉𝐵𝑊) → (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)
2819, 27jca 511 1 ((𝐴𝑉𝐵𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  Vcvv 3422  cin 3882  c0 4253  𝒫 cpw 4530  {csn 4558  cop 4564   cuni 4836   class class class wbr 5070   × cxp 5578  ran crn 5581  cfv 6418  1st c1st 7802  2nd c2nd 7803  cen 8688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-1st 7804  df-2nd 7805  df-en 8692
This theorem is referenced by:  disjenex  8871  domss2  8872
  Copyright terms: Public domain W3C validator