![]() |
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 5003 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∖ 𝐵) ∈ V) | |
2 | ssun2 3975 | . . . . 5 ⊢ 𝐴 ⊆ (𝐵 ∪ 𝐴) | |
3 | uncom 3955 | . . . . . 6 ⊢ ((𝐴 ∖ 𝐵) ∪ 𝐵) = (𝐵 ∪ (𝐴 ∖ 𝐵)) | |
4 | undif2 4238 | . . . . . 6 ⊢ (𝐵 ∪ (𝐴 ∖ 𝐵)) = (𝐵 ∪ 𝐴) | |
5 | 3, 4 | eqtr2i 2822 | . . . . 5 ⊢ (𝐵 ∪ 𝐴) = ((𝐴 ∖ 𝐵) ∪ 𝐵) |
6 | 2, 5 | sseqtri 3833 | . . . 4 ⊢ 𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) |
7 | unexg 7193 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) | |
8 | ssexg 4999 | . . . 4 ⊢ ((𝐴 ⊆ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∧ ((𝐴 ∖ 𝐵) ∪ 𝐵) ∈ V) → 𝐴 ∈ V) | |
9 | 6, 7, 8 | sylancr 582 | . . 3 ⊢ (((𝐴 ∖ 𝐵) ∈ V ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ V) |
10 | 9 | expcom 403 | . 2 ⊢ (𝐵 ∈ 𝐶 → ((𝐴 ∖ 𝐵) ∈ V → 𝐴 ∈ V)) |
11 | 1, 10 | impbid2 218 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ∈ V ↔ (𝐴 ∖ 𝐵) ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 385 ∈ wcel 2157 Vcvv 3385 ∖ cdif 3766 ∪ cun 3767 ⊆ wss 3769 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-sep 4975 ax-nul 4983 ax-pr 5097 ax-un 7183 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ral 3094 df-rex 3095 df-rab 3098 df-v 3387 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-sn 4369 df-pr 4371 df-uni 4629 |
This theorem is referenced by: elpwun 7211 |
Copyright terms: Public domain | W3C validator |