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

Theorem rnmptss 5326
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 5319 . 2  |-  ( A. x  e.  A  B  e.  C  <->  F : A --> C )
3 frn 5052 . 2  |-  ( F : A --> C  ->  ran  F  C_  C )
42, 3sylbi 114 1  |-  ( A. x  e.  A  B  e.  C  ->  ran  F  C_  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1243    e. wcel 1393   A.wral 2306    C_ wss 2917    |-> cmpt 3818   ran crn 4346   -->wf 4898
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fv 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator