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

Theorem rnmptss 5872
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 5861 . 2  |-  ( A. x  e.  A  B  e.  C  <->  F : A --> C )
3 frn 5545 . 2  |-  ( F : A --> C  ->  ran  F  C_  C )
42, 3sylbi 121 1  |-  ( A. x  e.  A  B  e.  C  ->  ran  F  C_  C )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220    |-> cmpt 4193   ran crn 4777   -->wf 5376
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388
This theorem is used by:  mptexw  6346  tgiun  15299  dvrecap  15939
  Copyright terms: Public domain W3C validator