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

Theorem f1ssr 5600
Description: Combine a one-to-one function with a restriction on the domain. (Contributed by Stefan O'Rear, 20-Feb-2015.)
Assertion
Ref Expression
f1ssr  |-  ( ( F : A -1-1-> B  /\  ran  F  C_  C
)  ->  F : A -1-1-> C )

Proof of Theorem f1ssr
StepHypRef Expression
1 f1fn 5595 . . . 4  |-  ( F : A -1-1-> B  ->  F  Fn  A )
21adantr 276 . . 3  |-  ( ( F : A -1-1-> B  /\  ran  F  C_  C
)  ->  F  Fn  A )
3 simpr 110 . . 3  |-  ( ( F : A -1-1-> B  /\  ran  F  C_  C
)  ->  ran  F  C_  C )
4 df-f 5376 . . 3  |-  ( F : A --> C  <->  ( F  Fn  A  /\  ran  F  C_  C ) )
52, 3, 4sylanbrc 421 . 2  |-  ( ( F : A -1-1-> B  /\  ran  F  C_  C
)  ->  F : A
--> C )
6 df-f1 5377 . . . 4  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  Fun  `' F ) )
76simprbi 275 . . 3  |-  ( F : A -1-1-> B  ->  Fun  `' F )
87adantr 276 . 2  |-  ( ( F : A -1-1-> B  /\  ran  F  C_  C
)  ->  Fun  `' F
)
9 df-f1 5377 . 2  |-  ( F : A -1-1-> C  <->  ( F : A --> C  /\  Fun  `' F ) )
105, 8, 9sylanbrc 421 1  |-  ( ( F : A -1-1-> B  /\  ran  F  C_  C
)  ->  F : A -1-1-> C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    C_ wss 3220   `'ccnv 4768   ran crn 4770   Fun wfun 5366    Fn wfn 5367   -->wf 5368   -1-1->wf1 5369
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108
This theorem depends on definitions:  df-bi 117  df-f 5376  df-f1 5377
This theorem is referenced by:  f1ff1  5601  difinfsn  7430  ausgrusgrien  16326  uspgrupgrushgr  16337  usgrumgruspgr  16340  usgruspgrben  16341
  Copyright terms: Public domain W3C validator