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

Theorem disjen 9130
Description: A stronger form of pwuninel 8256. We can use pwuninel 8256, 2pwuninel 9128 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 727 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
3 simprl 769 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥𝐴)
42, 3eqeltrrd 2834 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴)
5 fvex 6901 . . . . . . 7 (1st𝑥) ∈ V
6 fvex 6901 . . . . . . 7 (2nd𝑥) ∈ V
75, 6opelrn 5940 . . . . . 6 (⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴 → (2nd𝑥) ∈ ran 𝐴)
84, 7syl 17 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ ran 𝐴)
9 pwuninel 8256 . . . . . 6 ¬ 𝒫 ran 𝐴 ∈ ran 𝐴
10 xp2nd 8004 . . . . . . . . 9 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
1110ad2antll 727 . . . . . . . 8 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
12 elsni 4644 . . . . . . . 8 ((2nd𝑥) ∈ {𝒫 ran 𝐴} → (2nd𝑥) = 𝒫 ran 𝐴)
1311, 12syl 17 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) = 𝒫 ran 𝐴)
1413eleq1d 2818 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ((2nd𝑥) ∈ ran 𝐴 ↔ 𝒫 ran 𝐴 ∈ ran 𝐴))
159, 14mtbiri 326 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ¬ (2nd𝑥) ∈ ran 𝐴)
168, 15pm2.65da 815 . . . 4 ((𝐴𝑉𝐵𝑊) → ¬ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
17 elin 3963 . . . 4 (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
1816, 17sylnibr 328 . . 3 ((𝐴𝑉𝐵𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})))
1918eq0rdv 4403 . 2 ((𝐴𝑉𝐵𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅)
20 simpr 485 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
21 rnexg 7891 . . . . 5 (𝐴𝑉 → ran 𝐴 ∈ V)
2221adantr 481 . . . 4 ((𝐴𝑉𝐵𝑊) → ran 𝐴 ∈ V)
23 uniexg 7726 . . . 4 (ran 𝐴 ∈ V → ran 𝐴 ∈ V)
24 pwexg 5375 . . . 4 ( ran 𝐴 ∈ V → 𝒫 ran 𝐴 ∈ V)
2522, 23, 243syl 18 . . 3 ((𝐴𝑉𝐵𝑊) → 𝒫 ran 𝐴 ∈ V)
26 xpsneng 9052 . . 3 ((𝐵𝑊 ∧ 𝒫 ran 𝐴 ∈ V) → (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)
2720, 25, 26syl2anc 584 . 2 ((𝐴𝑉𝐵𝑊) → (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)
2819, 27jca 512 1 ((𝐴𝑉𝐵𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  Vcvv 3474  cin 3946  c0 4321  𝒫 cpw 4601  {csn 4627  cop 4633   cuni 4907   class class class wbr 5147   × cxp 5673  ran crn 5676  cfv 6540  1st c1st 7969  2nd c2nd 7970  cen 8932
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-1st 7971  df-2nd 7972  df-en 8936
This theorem is referenced by:  disjenex  9131  domss2  9132
  Copyright terms: Public domain W3C validator