| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjenex | Structured version Visualization version GIF version | ||
| Description: Existence version of disjen 9062. (Contributed by Mario Carneiro, 7-Feb-2015.) |
| Ref | Expression |
|---|---|
| disjenex | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∃𝑥((𝐴 ∩ 𝑥) = ∅ ∧ 𝑥 ≈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 485 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊) | |
| 2 | snex 5368 | . . 3 ⊢ {𝒫 ∪ ran 𝐴} ∈ V | |
| 3 | xpexg 7693 | . . 3 ⊢ ((𝐵 ∈ 𝑊 ∧ {𝒫 ∪ ran 𝐴} ∈ V) → (𝐵 × {𝒫 ∪ ran 𝐴}) ∈ V) | |
| 4 | 1, 2, 3 | sylancl 592 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × {𝒫 ∪ ran 𝐴}) ∈ V) |
| 5 | disjen 9062 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)) | |
| 6 | ineq2 4143 | . . . 4 ⊢ (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → (𝐴 ∩ 𝑥) = (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴}))) | |
| 7 | 6 | eqeq1d 2741 | . . 3 ⊢ (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → ((𝐴 ∩ 𝑥) = ∅ ↔ (𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅)) |
| 8 | breq1 5075 | . . 3 ⊢ (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → (𝑥 ≈ 𝐵 ↔ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵)) | |
| 9 | 7, 8 | anbi12d 638 | . 2 ⊢ (𝑥 = (𝐵 × {𝒫 ∪ ran 𝐴}) → (((𝐴 ∩ 𝑥) = ∅ ∧ 𝑥 ≈ 𝐵) ↔ ((𝐴 ∩ (𝐵 × {𝒫 ∪ ran 𝐴})) = ∅ ∧ (𝐵 × {𝒫 ∪ ran 𝐴}) ≈ 𝐵))) |
| 10 | 4, 5, 9 | spcedv 3536 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∃𝑥((𝐴 ∩ 𝑥) = ∅ ∧ 𝑥 ≈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∃wex 1786 ∈ wcel 2119 Vcvv 3431 ∩ cin 3882 ∅c0 4261 𝒫 cpw 4529 {csn 4555 ∪ cuni 4838 class class class wbr 5072 × cxp 5616 ran crn 5619 ≈ cen 8880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-1st 7931 df-2nd 7932 df-en 8884 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |