| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difex2 | Structured version Visualization version GIF version | ||
| Description: If the subtrahend of a class difference exists, then the minuend exists iff the difference exists. (Contributed by NM, 12-Nov-2003.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) |
| Ref | Expression |
|---|---|
| difex2 | ⊢ (𝐵 ∈ 𝐶 → (𝐴 ∈ V ↔ (𝐴 ∖ 𝐵) ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difexg 5264 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∖ 𝐵) ∈ V) | |
| 2 | ssun2 4115 | . . . . 5 ⊢ 𝐴 ⊆ (𝐵 ∪ 𝐴) | |
| 3 | uncom 4095 | . . . . . 6 ⊢ ((𝐴 ∖ 𝐵) ∪ 𝐵) = (𝐵 ∪ (𝐴 ∖ 𝐵)) | |
| 4 | undif2 4412 | . . . . . 6 ⊢ (𝐵 ∪ (𝐴 ∖ 𝐵)) = (𝐵 ∪ 𝐴) | |
| 5 | 3, 4 | eqtr2i 2764 | . . . . 5 ⊢ (𝐵 ∪ 𝐴) = ((𝐴 ∖ 𝐵) ∪ 𝐵) |
| 6 | 2, 5 | sseqtri 3970 | . . . 4 ⊢ 𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) |
| 7 | unexg 7693 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) | |
| 8 | ssexg 5258 | . . . 4 ⊢ ((𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∧ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) → 𝐴 ∈ V) | |
| 9 | 6, 7, 8 | sylancr 593 | . . 3 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ V) |
| 10 | 9 | expcom 414 | . 2 ⊢ (𝐵 ∈ 𝐶 → ((𝐴 ∖ 𝐵) ∈ V → 𝐴 ∈ V)) |
| 11 | 1, 10 | impbid2 227 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ∈ V ↔ (𝐴 ∖ 𝐵) ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2119 Vcvv 3432 ∖ cdif 3887 ∪ cun 3888 ⊆ wss 3890 |
| 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-ext 2712 ax-sep 5225 ax-pr 5369 ax-un 7685 |
| 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-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-sn 4563 df-pr 4565 df-uni 4846 |
| This theorem is referenced by: elpwun 7719 |
| Copyright terms: Public domain | W3C validator |