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

Theorem basis1 12685
Description: Property of a basis. (Contributed by NM, 16-Jul-2006.)
Assertion
Ref Expression
basis1  |-  ( ( B  e.  TopBases  /\  C  e.  B  /\  D  e.  B )  ->  ( C  i^i  D )  C_  U. ( B  i^i  ~P ( C  i^i  D ) ) )

Proof of Theorem basis1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isbasisg 12682 . . . 4  |-  ( B  e.  TopBases  ->  ( B  e.  TopBases  <->  A. x  e.  B  A. y  e.  B  (
x  i^i  y )  C_ 
U. ( B  i^i  ~P ( x  i^i  y
) ) ) )
21ibi 175 . . 3  |-  ( B  e.  TopBases  ->  A. x  e.  B  A. y  e.  B  ( x  i^i  y
)  C_  U. ( B  i^i  ~P ( x  i^i  y ) ) )
3 ineq1 3316 . . . . 5  |-  ( x  =  C  ->  (
x  i^i  y )  =  ( C  i^i  y ) )
43pweqd 3564 . . . . . . 7  |-  ( x  =  C  ->  ~P ( x  i^i  y
)  =  ~P ( C  i^i  y ) )
54ineq2d 3323 . . . . . 6  |-  ( x  =  C  ->  ( B  i^i  ~P ( x  i^i  y ) )  =  ( B  i^i  ~P ( C  i^i  y
) ) )
65unieqd 3800 . . . . 5  |-  ( x  =  C  ->  U. ( B  i^i  ~P ( x  i^i  y ) )  =  U. ( B  i^i  ~P ( C  i^i  y ) ) )
73, 6sseq12d 3173 . . . 4  |-  ( x  =  C  ->  (
( x  i^i  y
)  C_  U. ( B  i^i  ~P ( x  i^i  y ) )  <-> 
( C  i^i  y
)  C_  U. ( B  i^i  ~P ( C  i^i  y ) ) ) )
8 ineq2 3317 . . . . 5  |-  ( y  =  D  ->  ( C  i^i  y )  =  ( C  i^i  D
) )
98pweqd 3564 . . . . . . 7  |-  ( y  =  D  ->  ~P ( C  i^i  y
)  =  ~P ( C  i^i  D ) )
109ineq2d 3323 . . . . . 6  |-  ( y  =  D  ->  ( B  i^i  ~P ( C  i^i  y ) )  =  ( B  i^i  ~P ( C  i^i  D
) ) )
1110unieqd 3800 . . . . 5  |-  ( y  =  D  ->  U. ( B  i^i  ~P ( C  i^i  y ) )  =  U. ( B  i^i  ~P ( C  i^i  D ) ) )
128, 11sseq12d 3173 . . . 4  |-  ( y  =  D  ->  (
( C  i^i  y
)  C_  U. ( B  i^i  ~P ( C  i^i  y ) )  <-> 
( C  i^i  D
)  C_  U. ( B  i^i  ~P ( C  i^i  D ) ) ) )
137, 12rspc2v 2843 . . 3  |-  ( ( C  e.  B  /\  D  e.  B )  ->  ( A. x  e.  B  A. y  e.  B  ( x  i^i  y )  C_  U. ( B  i^i  ~P ( x  i^i  y ) )  ->  ( C  i^i  D )  C_  U. ( B  i^i  ~P ( C  i^i  D ) ) ) )
142, 13syl5com 29 . 2  |-  ( B  e.  TopBases  ->  ( ( C  e.  B  /\  D  e.  B )  ->  ( C  i^i  D )  C_  U. ( B  i^i  ~P ( C  i^i  D ) ) ) )
15143impib 1191 1  |-  ( ( B  e.  TopBases  /\  C  e.  B  /\  D  e.  B )  ->  ( C  i^i  D )  C_  U. ( B  i^i  ~P ( C  i^i  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 968    = wceq 1343    e. wcel 2136   A.wral 2444    i^i cin 3115    C_ wss 3116   ~Pcpw 3559   U.cuni 3789   TopBasesctb 12680
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-in 3122  df-ss 3129  df-pw 3561  df-uni 3790  df-bases 12681
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator