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

Theorem disjen 9098
Description: A stronger form of pwuninel 8254. We can use pwuninel 8254, 2pwuninel 9096 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 8007 . . . . . . . 8 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
21ad2antll 729 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
3 simprl 770 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → 𝑥𝐴)
42, 3eqeltrrd 2829 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴)
5 fvex 6871 . . . . . . 7 (1st𝑥) ∈ V
6 fvex 6871 . . . . . . 7 (2nd𝑥) ∈ V
75, 6opelrn 5907 . . . . . 6 (⟨(1st𝑥), (2nd𝑥)⟩ ∈ 𝐴 → (2nd𝑥) ∈ ran 𝐴)
84, 7syl 17 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ ran 𝐴)
9 pwuninel 8254 . . . . . 6 ¬ 𝒫 ran 𝐴 ∈ ran 𝐴
10 xp2nd 8001 . . . . . . . . 9 (𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
1110ad2antll 729 . . . . . . . 8 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) ∈ {𝒫 ran 𝐴})
12 elsni 4606 . . . . . . . 8 ((2nd𝑥) ∈ {𝒫 ran 𝐴} → (2nd𝑥) = 𝒫 ran 𝐴)
1311, 12syl 17 . . . . . . 7 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → (2nd𝑥) = 𝒫 ran 𝐴)
1413eleq1d 2813 . . . . . 6 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ((2nd𝑥) ∈ ran 𝐴 ↔ 𝒫 ran 𝐴 ∈ ran 𝐴))
159, 14mtbiri 327 . . . . 5 (((𝐴𝑉𝐵𝑊) ∧ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴}))) → ¬ (2nd𝑥) ∈ ran 𝐴)
168, 15pm2.65da 816 . . . 4 ((𝐴𝑉𝐵𝑊) → ¬ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
17 elin 3930 . . . 4 (𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × {𝒫 ran 𝐴})))
1816, 17sylnibr 329 . . 3 ((𝐴𝑉𝐵𝑊) → ¬ 𝑥 ∈ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})))
1918eq0rdv 4370 . 2 ((𝐴𝑉𝐵𝑊) → (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅)
20 simpr 484 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
21 rnexg 7878 . . . . 5 (𝐴𝑉 → ran 𝐴 ∈ V)
2221adantr 480 . . . 4 ((𝐴𝑉𝐵𝑊) → ran 𝐴 ∈ V)
23 uniexg 7716 . . . 4 (ran 𝐴 ∈ V → ran 𝐴 ∈ V)
24 pwexg 5333 . . . 4 ( ran 𝐴 ∈ V → 𝒫 ran 𝐴 ∈ V)
2522, 23, 243syl 18 . . 3 ((𝐴𝑉𝐵𝑊) → 𝒫 ran 𝐴 ∈ V)
26 xpsneng 9026 . . 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 3447  cin 3913  c0 4296  𝒫 cpw 4563  {csn 4589  cop 4595   cuni 4871   class class class wbr 5107   × cxp 5636  ran crn 5639  cfv 6511  1st c1st 7966  2nd c2nd 7967  cen 8915
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 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-1st 7968  df-2nd 7969  df-en 8919
This theorem is referenced by:  disjenex  9099  domss2  9100
  Copyright terms: Public domain W3C validator