Theorem f1ssr 6789

Description: A function that is one-to-one is also one-to-one on some superset of its range. (Contributed by Stefan O'Rear, 20-Feb-2015.)

Assertion

Ref	Expression
f1ssr	⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴–1-1→𝐶)

Proof of Theorem f1ssr

Step	Hyp	Ref	Expression
1		f1fn 6782	. . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴)
2	1	adantr 486	. . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹 Fn 𝐴)
3		simpr 490	. . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → ran 𝐹 ⊆ 𝐶)
4		df-f 6547	. . 3 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶))
5	2, 3, 4	sylanbrc 595	. 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴⟶𝐶)
6		df-f1 6548	. . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹))
7	6	simprbi 503	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹)
8	7	adantr 486	. 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → Fun ◡𝐹)
9		df-f1 6548	. 2 ⊢ (𝐹:𝐴–1-1→𝐶 ↔ (𝐹:𝐴⟶𝐶 ∧ Fun ◡𝐹))
10	5, 8, 9	sylanbrc 595	1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴–1-1→𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ⊆ wss 3908  ^◡ccnv 5665  ran crn 5667  Fun wfun 6537   Fn wfn 6538  ⟶wf 6539  –1-1→wf1 6540

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-f 6547  df-f1 6548

This theorem is used by:  f1resf1  6791  domdifsn  9058  marypha1  9404  m2cpmf1  22937  ausgrusgri  29555  uspgrupgrushgr  29566  usgrumgruspgr  29569  usgruspgrb  29570  usgrres  29695  usgrres1  29702  lindflbs  33723  dimkerim  34048  fineqvinfep  35562  cantnfub2  44090