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

Theorem fiss 7105
Description: Subset relationship for function  fi. (Contributed by Jeff Hankins, 7-Oct-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)
Assertion
Ref Expression
fiss  |-  ( ( B  e.  V  /\  A  C_  B )  -> 
( fi `  A
)  C_  ( fi `  B ) )

Proof of Theorem fiss
Dummy variables  r  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 110 . . . 4  |-  ( ( B  e.  V  /\  A  C_  B )  ->  A  C_  B )
2 sspwb 4278 . . . . 5  |-  ( A 
C_  B  <->  ~P A  C_ 
~P B )
3 ssrin 3406 . . . . 5  |-  ( ~P A  C_  ~P B  ->  ( ~P A  i^i  Fin )  C_  ( ~P B  i^i  Fin ) )
42, 3sylbi 121 . . . 4  |-  ( A 
C_  B  ->  ( ~P A  i^i  Fin )  C_  ( ~P B  i^i  Fin ) )
5 ssrexv 3266 . . . 4  |-  ( ( ~P A  i^i  Fin )  C_  ( ~P B  i^i  Fin )  ->  ( E. x  e.  ( ~P A  i^i  Fin )
r  =  |^| x  ->  E. x  e.  ( ~P B  i^i  Fin ) r  =  |^| x ) )
61, 4, 53syl 17 . . 3  |-  ( ( B  e.  V  /\  A  C_  B )  -> 
( E. x  e.  ( ~P A  i^i  Fin ) r  =  |^| x  ->  E. x  e.  ( ~P B  i^i  Fin ) r  =  |^| x ) )
7 vex 2779 . . . 4  |-  r  e. 
_V
8 simpl 109 . . . . 5  |-  ( ( B  e.  V  /\  A  C_  B )  ->  B  e.  V )
98, 1ssexd 4200 . . . 4  |-  ( ( B  e.  V  /\  A  C_  B )  ->  A  e.  _V )
10 elfi 7099 . . . 4  |-  ( ( r  e.  _V  /\  A  e.  _V )  ->  ( r  e.  ( fi `  A )  <->  E. x  e.  ( ~P A  i^i  Fin )
r  =  |^| x
) )
117, 9, 10sylancr 414 . . 3  |-  ( ( B  e.  V  /\  A  C_  B )  -> 
( r  e.  ( fi `  A )  <->  E. x  e.  ( ~P A  i^i  Fin )
r  =  |^| x
) )
12 elfi 7099 . . . . 5  |-  ( ( r  e.  _V  /\  B  e.  V )  ->  ( r  e.  ( fi `  B )  <->  E. x  e.  ( ~P B  i^i  Fin )
r  =  |^| x
) )
137, 12mpan 424 . . . 4  |-  ( B  e.  V  ->  (
r  e.  ( fi
`  B )  <->  E. x  e.  ( ~P B  i^i  Fin ) r  =  |^| x ) )
1413adantr 276 . . 3  |-  ( ( B  e.  V  /\  A  C_  B )  -> 
( r  e.  ( fi `  B )  <->  E. x  e.  ( ~P B  i^i  Fin )
r  =  |^| x
) )
156, 11, 143imtr4d 203 . 2  |-  ( ( B  e.  V  /\  A  C_  B )  -> 
( r  e.  ( fi `  A )  ->  r  e.  ( fi `  B ) ) )
1615ssrdv 3207 1  |-  ( ( B  e.  V  /\  A  C_  B )  -> 
( fi `  A
)  C_  ( fi `  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2178   E.wrex 2487   _Vcvv 2776    i^i cin 3173    C_ wss 3174   ~Pcpw 3626   |^|cint 3899   ` cfv 5290   Fincfn 6850   ficfi 7096
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-iinf 4654
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-er 6643  df-en 6851  df-fin 6853  df-fi 7097
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator