Theorem pwundifss 4022

Description: Break up the power class of a union into a union of smaller classes. (Contributed by Jim Kingdon, 30-Sep-2018.)

Assertion

Ref	Expression
pwundifss	|- ( ( ~P ( A u. B ) \ ~P A ) u. ~P A ) C_ ~P ( A u. B )

Proof of Theorem pwundifss

Step	Hyp	Ref	Expression
1		undif1ss 3298	. 2 |- ( ( ~P ( A u. B ) \ ~P A ) u. ~P A ) C_ ( ~P ( A u. B ) u. ~P A )
2		pwunss 4020	. . . . 5 |- ( ~P A u. ~P B ) C_ ~P ( A u. B )
3		unss 3117	. . . . 5 |- ( ( ~P A C_ ~P ( A u. B ) /\ ~P B C_ ~P ( A u. B ) ) <-> ( ~P A u. ~P B ) C_ ~P ( A u. B ) )
4	2, 3	mpbir 134	. . . 4 |- ( ~P A C_ ~P ( A u. B ) /\ ~P B C_ ~P ( A u. B ) )
5	4	simpli 104	. . 3 |- ~P A C_ ~P ( A u. B )
6		ssequn2 3116	. . 3 |- ( ~P A C_ ~P ( A u. B ) <-> ( ~P ( A u. B ) u. ~P A ) = ~P ( A u. B ) )
7	5, 6	mpbi 133	. 2 |- ( ~P ( A u. B ) u. ~P A ) = ~P ( A u. B )
8	1, 7	sseqtri 2977	1 |- ( ( ~P ( A u. B ) \ ~P A ) u. ~P A ) C_ ~P ( A u. B )

Syntax hints:   /\ wa 97   = wceq 1243   \ cdif 2914   u. cun 2915   C_ wss 2917   ~Pcpw 3359

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361

This theorem is referenced by: (None)