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

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

Proof of Theorem disjenex
StepHypRef Expression
1 simpr 490 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊)
2 snex 5397 . . 3 {𝒫 ∪ ran 𝐴} ∈ V
3 xpexg 7762 . . 3 ((𝐵 ∈ 𝑊 ∧ {𝒫 ∪ ran 𝐴} ∈ V) → (𝐵 × {𝒫 ∪ ran 𝐴}) ∈ V)
41, 2, 3sylancl 598 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × {𝒫 ∪ ran 𝐴}) ∈ V)
5 disjen 9146 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵))
6 ineq2 4160 . . . 4 (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → (𝐴 ∩ 𝑥) = (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})))
76eqeq1d 2763 . . 3 (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → ((𝐴 ∩ 𝑥) = ∅ ↔ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅))
8 breq1 5106 . . 3 (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → (𝑥 ≈ 𝐵 ↔ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵))
97, 8anbi12d 644 . 2 (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → (((𝐴 ∩ 𝑥) = ∅ ∧ 𝑥 ≈ 𝐵) ↔ ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)))
104, 5, 9spcedv 3553 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∃𝑥((𝐴 ∩ 𝑥) = ∅ ∧ 𝑥 ≈ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  Vcvv 3451   ∩ cin 3898  ∅c0 4279  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867   class class class wbr 5103   × cxp 5649  ran crn 5652   ≈ cen 8963
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-1st 7999  df-2nd 8000  df-en 8967
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator