| 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 5296 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∖ 𝐵) ∈ V) | |
| 2 | ssun2 4180 | . . . . 5 ⊢ 𝐴 ⊆ (𝐵 ∪ 𝐴) | |
| 3 | uncom 4160 | . . . . . 6 ⊢ ((𝐴 ∖ 𝐵) ∪ 𝐵) = (𝐵 ∪ (𝐴 ∖ 𝐵)) | |
| 4 | undif2 4434 | . . . . . 6 ⊢ (𝐵 ∪ (𝐴 ∖ 𝐵)) = (𝐵 ∪ 𝐴) | |
| 5 | 3, 4 | eqtr2i 2787 | . . . . 5 ⊢ (𝐵 ∪ 𝐴) = ((𝐴 ∖ 𝐵) ∪ 𝐵) |
| 6 | 2, 5 | sseqtri 3961 | . . . 4 ⊢ 𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) |
| 7 | unexg 7790 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) | |
| 8 | ssexg 5286 | . . . 4 ⊢ ((𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∧ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) → 𝐴 ∈ V) | |
| 9 | 6, 7, 8 | sylancr 599 | . . 3 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ V) |
| 10 | 9 | expcom 419 | . 2 ⊢ (𝐵 ∈ 𝐶 → ((𝐴 ∖ 𝐵) ∈ V → 𝐴 ∈ V)) |
| 11 | 1, 10 | impbid2 229 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ∈ V ↔ (𝐴 ∖ 𝐵) ∈ V)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∪ cun 4152 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5253 ax-pr 5396 ax-un 7781 |
| 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-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-sn 4589 df-pr 4591 df-uni 4871 |
| This theorem is used by: elpwun 7813 acwer1prc 35886 |
| Copyright terms: Public domain | W3C validator |