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

Theorem fvss 5529
Description: The value of a function is a subset of  B if every element that could be a candidate for the value is a subset of  B. (Contributed by Mario Carneiro, 24-May-2019.)
Assertion
Ref Expression
fvss  |-  ( A. x ( A F x  ->  x  C_  B
)  ->  ( F `  A )  C_  B
)
Distinct variable groups:    x, A    x, B    x, F

Proof of Theorem fvss
StepHypRef Expression
1 df-fv 5224 . 2  |-  ( F `
 A )  =  ( iota x A F x )
2 iotass 5195 . 2  |-  ( A. x ( A F x  ->  x  C_  B
)  ->  ( iota x A F x ) 
C_  B )
31, 2eqsstrid 3201 1  |-  ( A. x ( A F x  ->  x  C_  B
)  ->  ( F `  A )  C_  B
)
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1351    C_ wss 3129   class class class wbr 4003   iotacio 5176   ` cfv 5216
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-uni 3810  df-iota 5178  df-fv 5224
This theorem is referenced by:  fvssunirng  5530  relfvssunirn  5531  sefvex  5536  fvmptss2  5591  tfrexlem  6334
  Copyright terms: Public domain W3C validator