| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > compsscnvlem | Structured version Visualization version GIF version | ||
| Description: Lemma for compsscnv 10314. (Contributed by Mario Carneiro, 17-May-2015.) |
| Ref | Expression |
|---|---|
| compsscnvlem | ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝑦 ∈ 𝒫 𝐴 ∧ 𝑥 = (𝐴 ∖ 𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 487 | . . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 = (𝐴 ∖ 𝑥)) | |
| 2 | difss 4080 | . . . 4 ⊢ (𝐴 ∖ 𝑥) ⊆ 𝐴 | |
| 3 | 1, 2 | eqsstrdi 3971 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 ⊆ 𝐴) |
| 4 | velpw 4550 | . . 3 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴) | |
| 5 | 3, 4 | sylibr 236 | . 2 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 ∈ 𝒫 𝐴) |
| 6 | 1 | difeq2d 4071 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝐴 ∖ 𝑦) = (𝐴 ∖ (𝐴 ∖ 𝑥))) |
| 7 | elpwi 4552 | . . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴) | |
| 8 | 7 | adantr 483 | . . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑥 ⊆ 𝐴) |
| 9 | dfss4 4212 | . . . 4 ⊢ (𝑥 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) | |
| 10 | 8, 9 | sylib 220 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) |
| 11 | 6, 10 | eqtr2d 2788 | . 2 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑥 = (𝐴 ∖ 𝑦)) |
| 12 | 5, 11 | jca 518 | 1 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝑦 ∈ 𝒫 𝐴 ∧ 𝑥 = (𝐴 ∖ 𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ∖ cdif 3892 ⊆ wss 3895 𝒫 cpw 4545 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-3an 1097 df-tru 1553 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-rab 3405 df-v 3446 df-dif 3898 df-in 3902 df-ss 3912 df-pw 4547 |
| This theorem is referenced by: compsscnv 10314 |
| Copyright terms: Public domain | W3C validator |