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

Theorem intss 3636
Description: Intersection of subclasses. (Contributed by NM, 14-Oct-1999.)
Assertion
Ref Expression
intss  |-  ( A 
C_  B  ->  |^| B  C_ 
|^| A )

Proof of Theorem intss
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imim1 70 . . . . 5  |-  ( ( y  e.  A  -> 
y  e.  B )  ->  ( ( y  e.  B  ->  x  e.  y )  ->  (
y  e.  A  ->  x  e.  y )
) )
21al2imi 1347 . . . 4  |-  ( A. y ( y  e.  A  ->  y  e.  B )  ->  ( A. y ( y  e.  B  ->  x  e.  y )  ->  A. y
( y  e.  A  ->  x  e.  y ) ) )
3 vex 2560 . . . . 5  |-  x  e. 
_V
43elint 3621 . . . 4  |-  ( x  e.  |^| B  <->  A. y
( y  e.  B  ->  x  e.  y ) )
53elint 3621 . . . 4  |-  ( x  e.  |^| A  <->  A. y
( y  e.  A  ->  x  e.  y ) )
62, 4, 53imtr4g 194 . . 3  |-  ( A. y ( y  e.  A  ->  y  e.  B )  ->  (
x  e.  |^| B  ->  x  e.  |^| A
) )
76alrimiv 1754 . 2  |-  ( A. y ( y  e.  A  ->  y  e.  B )  ->  A. x
( x  e.  |^| B  ->  x  e.  |^| A ) )
8 dfss2 2934 . 2  |-  ( A 
C_  B  <->  A. y
( y  e.  A  ->  y  e.  B ) )
9 dfss2 2934 . 2  |-  ( |^| B  C_  |^| A  <->  A. x
( x  e.  |^| B  ->  x  e.  |^| A ) )
107, 8, 93imtr4i 190 1  |-  ( A 
C_  B  ->  |^| B  C_ 
|^| A )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1241    e. wcel 1393    C_ wss 2917   |^|cint 3615
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-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-in 2924  df-ss 2931  df-int 3616
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator