| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > compsscnvlem | Structured version Visualization version GIF version | ||
| Description: Lemma for compsscnv 10370. (Contributed by Mario Carneiro, 17-May-2015.) |
| Ref | Expression |
|---|---|
| compsscnvlem | ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝑦 ∈ 𝒫 𝐴 ∧ 𝑥 = (𝐴 ∖ 𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 = (𝐴 ∖ 𝑥)) | |
| 2 | difss 4090 | . . . 4 ⊢ (𝐴 ∖ 𝑥) ⊆ 𝐴 | |
| 3 | 1, 2 | eqsstrdi 3982 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 ⊆ 𝐴) |
| 4 | velpw 4569 | . . 3 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴) | |
| 5 | 3, 4 | sylibr 237 | . 2 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 ∈ 𝒫 𝐴) |
| 6 | 1 | difeq2d 4081 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝐴 ∖ 𝑦) = (𝐴 ∖ (𝐴 ∖ 𝑥))) |
| 7 | elpwi 4571 | . . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴) | |
| 8 | 7 | adantr 486 | . . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑥 ⊆ 𝐴) |
| 9 | dfss4 4222 | . . . 4 ⊢ (𝑥 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) | |
| 10 | 8, 9 | sylib 221 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) |
| 11 | 6, 10 | eqtr2d 2801 | . 2 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑥 = (𝐴 ∖ 𝑦)) |
| 12 | 5, 11 | jca 521 | 1 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝑦 ∈ 𝒫 𝐴 ∧ 𝑥 = (𝐴 ∖ 𝑦))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∖ cdif 3903 ⊆ wss 3906 𝒫 cpw 4564 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-in 3913 df-ss 3923 df-pw 4566 |
| This theorem is used by: compsscnv 10370 |
| Copyright terms: Public domain | W3C validator |