| 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 5266 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∖ 𝐵) ∈ V) | |
| 2 | ssun2 4120 | . . . . 5 ⊢ 𝐴 ⊆ (𝐵 ∪ 𝐴) | |
| 3 | uncom 4099 | . . . . . 6 ⊢ ((𝐴 ∖ 𝐵) ∪ 𝐵) = (𝐵 ∪ (𝐴 ∖ 𝐵)) | |
| 4 | undif2 4418 | . . . . . 6 ⊢ (𝐵 ∪ (𝐴 ∖ 𝐵)) = (𝐵 ∪ 𝐴) | |
| 5 | 3, 4 | eqtr2i 2761 | . . . . 5 ⊢ (𝐵 ∪ 𝐴) = ((𝐴 ∖ 𝐵) ∪ 𝐵) |
| 6 | 2, 5 | sseqtri 3971 | . . . 4 ⊢ 𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) |
| 7 | unexg 7690 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) | |
| 8 | ssexg 5260 | . . . 4 ⊢ ((𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∧ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) → 𝐴 ∈ V) | |
| 9 | 6, 7, 8 | sylancr 588 | . . 3 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ V) |
| 10 | 9 | expcom 413 | . 2 ⊢ (𝐵 ∈ 𝐶 → ((𝐴 ∖ 𝐵) ∈ V → 𝐴 ∈ V)) |
| 11 | 1, 10 | impbid2 226 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ∈ V ↔ (𝐴 ∖ 𝐵) ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 Vcvv 3430 ∖ 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 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-sn 4569 df-pr 4571 df-uni 4852 |
| This theorem is referenced by: elpwun 7716 |
| Copyright terms: Public domain | W3C validator |