Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > compsscnvlem | Structured version Visualization version GIF version |
Description: Lemma for compsscnv 10111. (Contributed by Mario Carneiro, 17-May-2015.) |
Ref | Expression |
---|---|
compsscnvlem | ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝑦 ∈ 𝒫 𝐴 ∧ 𝑥 = (𝐴 ∖ 𝑦))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 484 | . . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 = (𝐴 ∖ 𝑥)) | |
2 | difss 4070 | . . . 4 ⊢ (𝐴 ∖ 𝑥) ⊆ 𝐴 | |
3 | 1, 2 | eqsstrdi 3979 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 ⊆ 𝐴) |
4 | velpw 4543 | . . 3 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴) | |
5 | 3, 4 | sylibr 233 | . 2 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑦 ∈ 𝒫 𝐴) |
6 | 1 | difeq2d 4061 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝐴 ∖ 𝑦) = (𝐴 ∖ (𝐴 ∖ 𝑥))) |
7 | elpwi 4547 | . . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴) | |
8 | 7 | adantr 480 | . . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑥 ⊆ 𝐴) |
9 | dfss4 4197 | . . . 4 ⊢ (𝑥 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) | |
10 | 8, 9 | sylib 217 | . . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) |
11 | 6, 10 | eqtr2d 2780 | . 2 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → 𝑥 = (𝐴 ∖ 𝑦)) |
12 | 5, 11 | jca 511 | 1 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 = (𝐴 ∖ 𝑥)) → (𝑦 ∈ 𝒫 𝐴 ∧ 𝑥 = (𝐴 ∖ 𝑦))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2109 ∖ cdif 3888 ⊆ wss 3891 𝒫 cpw 4538 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-ext 2710 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1544 df-ex 1786 df-sb 2071 df-clab 2717 df-cleq 2731 df-clel 2817 df-rab 3074 df-v 3432 df-dif 3894 df-in 3898 df-ss 3908 df-pw 4540 |
This theorem is referenced by: compsscnv 10111 |
Copyright terms: Public domain | W3C validator |