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

Theorem ressbasssd 13102
Description: The base set of a restriction is a subset of the base set of the original structure. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 30-Apr-2015.)
Hypotheses
Ref Expression
ressbasd.r  |-  ( ph  ->  R  =  ( Ws  A ) )
ressbasd.b  |-  ( ph  ->  B  =  ( Base `  W ) )
ressbasd.w  |-  ( ph  ->  W  e.  X )
ressbasssd.a  |-  ( ph  ->  A  e.  V )
Assertion
Ref Expression
ressbasssd  |-  ( ph  ->  ( Base `  R
)  C_  B )

Proof of Theorem ressbasssd
StepHypRef Expression
1 ressbasd.r . . 3  |-  ( ph  ->  R  =  ( Ws  A ) )
2 ressbasd.b . . 3  |-  ( ph  ->  B  =  ( Base `  W ) )
3 ressbasd.w . . 3  |-  ( ph  ->  W  e.  X )
4 ressbasssd.a . . 3  |-  ( ph  ->  A  e.  V )
51, 2, 3, 4ressbasd 13100 . 2  |-  ( ph  ->  ( A  i^i  B
)  =  ( Base `  R ) )
6 inss2 3425 . 2  |-  ( A  i^i  B )  C_  B
75, 6eqsstrrdi 3277 1  |-  ( ph  ->  ( Base `  R
)  C_  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200    i^i cin 3196    C_ wss 3197   ` cfv 5318  (class class class)co 6001   Basecbs 13032   ↾s cress 13033
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1re 8093  ax-addrcl 8096
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-iota 5278  df-fun 5320  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-inn 9111  df-ndx 13035  df-slot 13036  df-base 13038  df-sets 13039  df-iress 13040
This theorem is referenced by:  subcmnd  13870  lidlssbas  14441
  Copyright terms: Public domain W3C validator