Theorem f1ssr 5605

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

Step	Hyp	Ref	Expression
1		f1fn 5600	. . . 4 |- ( F : A -1-1-> B -> F Fn A )
2	1	adantr 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 5381	. . 3 |- ( F : A --> C <-> ( F Fn A /\ ran F C_ C ) )
5	2, 3, 4	sylanbrc 421	. 2 |- ( ( F : A -1-1-> B /\ ran F C_ C ) -> F : A --> C )
6		df-f1 5382	. . . 4 |- ( F : A -1-1-> B <-> ( F : A --> B /\ Fun `' F ) )
7	6	simprbi 275	. . 3 |- ( F : A -1-1-> B -> Fun `' F )
8	7	adantr 276	. 2 |- ( ( F : A -1-1-> B /\ ran F C_ C ) -> Fun `' F )
9		df-f1 5382	. 2 |- ( F : A -1-1-> C <-> ( F : A --> C /\ Fun `' F ) )
10	5, 8, 9	sylanbrc 421	1 |- ( ( F : A -1-1-> B /\ ran F C_ C ) -> F : A -1-1-> C )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   C_ wss 3220   `'ccnv 4773   ran crn 4775   Fun wfun 5371   Fn wfn 5372   -->wf 5373   -1-1->wf1 5374

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This proof depends on definitions:  df-bi 117  df-f 5381  df-f1 5382

This theorem is used by:  f1ff1  5606  difinfsn  7440  ausgrusgrien  16412  uspgrupgrushgr  16423  usgrumgruspgr  16426  usgruspgrben  16427