MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hashbcss Unicode version

Theorem hashbcss 13292
Description: Subset relation for the binomial set. (Contributed by Mario Carneiro, 20-Apr-2015.)
Hypothesis
Ref Expression
ramval.c  |-  C  =  ( a  e.  _V ,  i  e.  NN0  |->  { b  e.  ~P a  |  ( # `  b
)  =  i } )
Assertion
Ref Expression
hashbcss  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  ( B C N )  C_  ( A C N ) )
Distinct variable groups:    a, b,
i    A, a, i    B, a, i    N, a, i
Allowed substitution hints:    A( b)    B( b)    C( i, a, b)    N( b)    V( i, a, b)

Proof of Theorem hashbcss
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 simp2 958 . . . 4  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  B  C_  A )
2 sspwb 4347 . . . 4  |-  ( B 
C_  A  <->  ~P B  C_ 
~P A )
31, 2sylib 189 . . 3  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  ~P B  C_  ~P A )
4 rabss2 3362 . . 3  |-  ( ~P B  C_  ~P A  ->  { x  e.  ~P B  |  ( # `  x
)  =  N }  C_ 
{ x  e.  ~P A  |  ( # `  x
)  =  N }
)
53, 4syl 16 . 2  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  { x  e.  ~P B  |  (
# `  x )  =  N }  C_  { x  e.  ~P A  |  (
# `  x )  =  N } )
6 simp1 957 . . . 4  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  A  e.  V )
76, 1ssexd 4284 . . 3  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  B  e.  _V )
8 simp3 959 . . 3  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  N  e.  NN0 )
9 ramval.c . . . 4  |-  C  =  ( a  e.  _V ,  i  e.  NN0  |->  { b  e.  ~P a  |  ( # `  b
)  =  i } )
109hashbcval 13290 . . 3  |-  ( ( B  e.  _V  /\  N  e.  NN0 )  -> 
( B C N )  =  { x  e.  ~P B  |  (
# `  x )  =  N } )
117, 8, 10syl2anc 643 . 2  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  ( B C N )  =  { x  e.  ~P B  |  ( # `  x
)  =  N }
)
129hashbcval 13290 . . 3  |-  ( ( A  e.  V  /\  N  e.  NN0 )  -> 
( A C N )  =  { x  e.  ~P A  |  (
# `  x )  =  N } )
13123adant2 976 . 2  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  ( A C N )  =  { x  e.  ~P A  |  ( # `  x
)  =  N }
)
145, 11, 133sstr4d 3327 1  |-  ( ( A  e.  V  /\  B  C_  A  /\  N  e.  NN0 )  ->  ( B C N )  C_  ( A C N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 936    = wceq 1649    e. wcel 1717   {crab 2646   _Vcvv 2892    C_ wss 3256   ~Pcpw 3735   ` cfv 5387  (class class class)co 6013    e. cmpt2 6015   NN0cn0 10146   #chash 11538
This theorem is referenced by:  ramval  13296  ramub2  13302  ramub1lem2  13315
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361  ax-sep 4264  ax-nul 4272  ax-pow 4311  ax-pr 4337
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2235  df-mo 2236  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ne 2545  df-ral 2647  df-rex 2648  df-rab 2651  df-v 2894  df-sbc 3098  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-nul 3565  df-if 3676  df-pw 3737  df-sn 3756  df-pr 3757  df-op 3759  df-uni 3951  df-br 4147  df-opab 4201  df-id 4432  df-xp 4817  df-rel 4818  df-cnv 4819  df-co 4820  df-dm 4821  df-iota 5351  df-fun 5389  df-fv 5395  df-ov 6016  df-oprab 6017  df-mpt2 6018
  Copyright terms: Public domain W3C validator