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

Theorem disjenex 8063
Description: Existence version of disjen 8062. (Contributed by Mario Carneiro, 7-Feb-2015.)
Assertion
Ref Expression
disjenex ((𝐴𝑉𝐵𝑊) → ∃𝑥((𝐴𝑥) = ∅ ∧ 𝑥𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑉   𝑥,𝑊

Proof of Theorem disjenex
StepHypRef Expression
1 simpr 477 . . 3 ((𝐴𝑉𝐵𝑊) → 𝐵𝑊)
2 snex 4874 . . 3 {𝒫 ran 𝐴} ∈ V
3 xpexg 6914 . . 3 ((𝐵𝑊 ∧ {𝒫 ran 𝐴} ∈ V) → (𝐵 × {𝒫 ran 𝐴}) ∈ V)
41, 2, 3sylancl 693 . 2 ((𝐴𝑉𝐵𝑊) → (𝐵 × {𝒫 ran 𝐴}) ∈ V)
5 disjen 8062 . 2 ((𝐴𝑉𝐵𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵))
6 ineq2 3791 . . . . 5 (𝑥 = (𝐵 × {𝒫 ran 𝐴}) → (𝐴𝑥) = (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})))
76eqeq1d 2628 . . . 4 (𝑥 = (𝐵 × {𝒫 ran 𝐴}) → ((𝐴𝑥) = ∅ ↔ (𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅))
8 breq1 4621 . . . 4 (𝑥 = (𝐵 × {𝒫 ran 𝐴}) → (𝑥𝐵 ↔ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵))
97, 8anbi12d 746 . . 3 (𝑥 = (𝐵 × {𝒫 ran 𝐴}) → (((𝐴𝑥) = ∅ ∧ 𝑥𝐵) ↔ ((𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵)))
109spcegv 3285 . 2 ((𝐵 × {𝒫 ran 𝐴}) ∈ V → (((𝐴 ∩ (𝐵 × {𝒫 ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ran 𝐴}) ≈ 𝐵) → ∃𝑥((𝐴𝑥) = ∅ ∧ 𝑥𝐵)))
114, 5, 10sylc 65 1 ((𝐴𝑉𝐵𝑊) → ∃𝑥((𝐴𝑥) = ∅ ∧ 𝑥𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1480  wex 1701  wcel 1992  Vcvv 3191  cin 3559  c0 3896  𝒫 cpw 4135  {csn 4153   cuni 4407   class class class wbr 4618   × cxp 5077  ran crn 5080  cen 7897
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-nel 2900  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3193  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-int 4446  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-f1 5855  df-fo 5856  df-f1o 5857  df-fv 5858  df-1st 7116  df-2nd 7117  df-en 7901
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator