Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sspw | Structured version Visualization version GIF version |
Description: The powerclass preserves inclusion. See sspwb 5365 for the biconditional version. (Contributed by NM, 13-Oct-1996.) Extract forward implication of sspwb 5365 since it requires fewer axioms. (Revised by BJ, 13-Apr-2024.) |
Ref | Expression |
---|---|
sspw | ⊢ (𝐴 ⊆ 𝐵 → 𝒫 𝐴 ⊆ 𝒫 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sstr2 3928 | . . . 4 ⊢ (𝑥 ⊆ 𝐴 → (𝐴 ⊆ 𝐵 → 𝑥 ⊆ 𝐵)) | |
2 | 1 | com12 32 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵)) |
3 | velpw 4538 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴) | |
4 | velpw 4538 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝐵 ↔ 𝑥 ⊆ 𝐵) | |
5 | 2, 3, 4 | 3imtr4g 296 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵)) |
6 | 5 | ssrdv 3927 | 1 ⊢ (𝐴 ⊆ 𝐵 → 𝒫 𝐴 ⊆ 𝒫 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2106 ⊆ wss 3887 𝒫 cpw 4533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-v 3434 df-in 3894 df-ss 3904 df-pw 4535 |
This theorem is referenced by: sspwi 4547 sspwd 4548 sspwb 5365 r1pwss 9542 elsigagen2 32116 measres 32190 |
Copyright terms: Public domain | W3C validator |