ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  pwundifss Unicode version

Theorem pwundifss 4013
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  u.  \  ~P  u.  ~P 
C_  ~P  u.

Proof of Theorem pwundifss
StepHypRef Expression
1 undif1ss 3292 . 2  ~P  u.  \  ~P  u.  ~P 
C_  ~P  u.  u. 
~P
2 pwunss 4011 . . . . 5  ~P  u.  ~P  C_  ~P  u.
3 unss 3111 . . . . 5  ~P  C_  ~P  u.  ~P  C_  ~P  u.  ~P  u.  ~P 
C_  ~P  u.
42, 3mpbir 134 . . . 4  ~P  C_  ~P  u.  ~P  C_  ~P  u.
54simpli 104 . . 3  ~P  C_ 
~P  u.
6 ssequn2 3110 . . 3  ~P  C_  ~P  u.  ~P  u.  u.  ~P  ~P  u.
75, 6mpbi 133 . 2  ~P  u.  u.  ~P  ~P  u.
81, 7sseqtri 2971 1  ~P  u.  \  ~P  u.  ~P 
C_  ~P  u.
Colors of variables: wff set class
Syntax hints:   wa 97   wceq 1242    \ cdif 2908    u. cun 2909    C_ wss 2911   ~Pcpw 3351
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 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-v 2553  df-dif 2914  df-un 2916  df-in 2918  df-ss 2925  df-pw 3353
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator