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

Theorem rnmptss 5549
Description: The range of an operation given by the maps-to notation as a subset. (Contributed by Thierry Arnoux, 24-Sep-2017.)
Hypothesis
Ref Expression
rnmptss.1  |-  F  =  ( x  e.  A  |->  B )
Assertion
Ref Expression
rnmptss  |-  ( A. x  e.  A  B  e.  C  ->  ran  F  C_  C )
Distinct variable groups:    x, A    x, C
Allowed substitution hints:    B( x)    F( x)

Proof of Theorem rnmptss
StepHypRef Expression
1 rnmptss.1 . . 3  |-  F  =  ( x  e.  A  |->  B )
21fmpt 5538 . 2  |-  ( A. x  e.  A  B  e.  C  <->  F : A --> C )
3 frn 5251 . 2  |-  ( F : A --> C  ->  ran  F  C_  C )
42, 3sylbi 120 1  |-  ( A. x  e.  A  B  e.  C  ->  ran  F  C_  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1316    e. wcel 1465   A.wral 2393    C_ wss 3041    |-> cmpt 3959   ran crn 4510   -->wf 5089
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-rab 2402  df-v 2662  df-sbc 2883  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-opab 3960  df-mpt 3961  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-res 4521  df-ima 4522  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-fv 5101
This theorem is referenced by:  tgiun  12169  dvrecap  12773
  Copyright terms: Public domain W3C validator