Metamath Proof Explorer


Theorem sspwimpcfVD

Description: The following User's Proof is a Virtual Deduction proof (see wvd1 ) 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 is sspwimpcfVD without virtual deductions and was derived from sspwimpcfVD . 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.)

1:: |- (. A C_ B ->. A C_ B ).
2:: |- (. ........... x e. ~P A ->. x e. ~P A ).
3:2: |- (. ........... x e. ~P A ->. x C_ A ).
4:3,1: |- (. (. A C_ B ,. x e. ~P A ). ->. x C_ B ).
5:: |- x e.V
6:4,5: |- (. (. A C B ,. x e. ~P A ). ->. x e. ~P B ).
7:6: |- (. A C_ B ->. ( x e. ~P A -> x e. ~P B ) ).
8:7: |- (. A C_ B ->. A. x ( x e. ~P A -> x e. ~P B ) ).
9:8: |- (. A C_ B ->. ~P A C_ ~P B ).
qed:9: |- ( A C_ B -> ~P A C_ ~P B )

Ref Expression
Assertion sspwimpcfVD A B 𝒫 A 𝒫 B

Proof

Step Hyp Ref Expression
1 vex x V
2 idn1 A B A B
3 idn1 x 𝒫 A x 𝒫 A
4 elpwi x 𝒫 A x A
5 3 4 el1 x 𝒫 A x A
6 sstr2 x A A B x B
7 6 impcom A B x A x B
8 2 5 7 el12 A B x 𝒫 A x B
9 elpwg x V x 𝒫 B x B
10 9 biimpar x V x B x 𝒫 B
11 1 8 10 el021old A B x 𝒫 A x 𝒫 B
12 11 int2 A B x 𝒫 A x 𝒫 B
13 12 gen11 A B x x 𝒫 A x 𝒫 B
14 dfss2 𝒫 A 𝒫 B x x 𝒫 A x 𝒫 B
15 14 biimpri x x 𝒫 A x 𝒫 B 𝒫 A 𝒫 B
16 13 15 el1 A B 𝒫 A 𝒫 B
17 16 in1 A B 𝒫 A 𝒫 B