Mathbox for Alan Sare |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sspwimpcfVD | Structured version Visualization version GIF version |
Description: The following User's Proof is a Virtual Deduction proof (see wvd1 40910)
using conjunction-form virtual hypothesis collections. It was completed
automatically by a tools program which would invokes Mel L. O'Cat's mmj2
and Norm Megill's Metamath Proof Assistant.
sspwimpcf 41261 is sspwimpcfVD 41262 without virtual deductions and was derived
from sspwimpcfVD 41262.
The version of completeusersproof.cmd used is capable of only generating
conjunction-form unification theorems, not unification deductions.
(Contributed by Alan Sare, 13-Jun-2015.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
Ref | Expression |
---|---|
sspwimpcfVD | ⊢ (𝐴 ⊆ 𝐵 → 𝒫 𝐴 ⊆ 𝒫 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3499 | . . . . . 6 ⊢ 𝑥 ∈ V | |
2 | idn1 40915 | . . . . . . 7 ⊢ ( 𝐴 ⊆ 𝐵 ▶ 𝐴 ⊆ 𝐵 ) | |
3 | idn1 40915 | . . . . . . . 8 ⊢ ( 𝑥 ∈ 𝒫 𝐴 ▶ 𝑥 ∈ 𝒫 𝐴 ) | |
4 | elpwi 4550 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴) | |
5 | 3, 4 | el1 40969 | . . . . . . 7 ⊢ ( 𝑥 ∈ 𝒫 𝐴 ▶ 𝑥 ⊆ 𝐴 ) |
6 | sstr2 3976 | . . . . . . . 8 ⊢ (𝑥 ⊆ 𝐴 → (𝐴 ⊆ 𝐵 → 𝑥 ⊆ 𝐵)) | |
7 | 6 | impcom 410 | . . . . . . 7 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → 𝑥 ⊆ 𝐵) |
8 | 2, 5, 7 | el12 41067 | . . . . . 6 ⊢ ( ( 𝐴 ⊆ 𝐵 , 𝑥 ∈ 𝒫 𝐴 ) ▶ 𝑥 ⊆ 𝐵 ) |
9 | elpwg 4544 | . . . . . . 7 ⊢ (𝑥 ∈ V → (𝑥 ∈ 𝒫 𝐵 ↔ 𝑥 ⊆ 𝐵)) | |
10 | 9 | biimpar 480 | . . . . . 6 ⊢ ((𝑥 ∈ V ∧ 𝑥 ⊆ 𝐵) → 𝑥 ∈ 𝒫 𝐵) |
11 | 1, 8, 10 | el021old 41042 | . . . . 5 ⊢ ( ( 𝐴 ⊆ 𝐵 , 𝑥 ∈ 𝒫 𝐴 ) ▶ 𝑥 ∈ 𝒫 𝐵 ) |
12 | 11 | int2 40947 | . . . 4 ⊢ ( 𝐴 ⊆ 𝐵 ▶ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) ) |
13 | 12 | gen11 40957 | . . 3 ⊢ ( 𝐴 ⊆ 𝐵 ▶ ∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) ) |
14 | dfss2 3957 | . . . 4 ⊢ (𝒫 𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵)) | |
15 | 14 | biimpri 230 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) → 𝒫 𝐴 ⊆ 𝒫 𝐵) |
16 | 13, 15 | el1 40969 | . 2 ⊢ ( 𝐴 ⊆ 𝐵 ▶ 𝒫 𝐴 ⊆ 𝒫 𝐵 ) |
17 | 16 | in1 40912 | 1 ⊢ (𝐴 ⊆ 𝐵 → 𝒫 𝐴 ⊆ 𝒫 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1535 ∈ wcel 2114 Vcvv 3496 ⊆ wss 3938 𝒫 cpw 4541 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-v 3498 df-in 3945 df-ss 3954 df-pw 4543 df-vd1 40911 df-vhc2 40922 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |