Theorem f2ndf 8111

Description: The 2^nd (second component of an ordered pair) function restricted to a function 𝐹 is a function from 𝐹 into the codomain of 𝐹. (Contributed by Alexander van der Vekens, 4-Feb-2018.)

Assertion

Ref	Expression
f2ndf	⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹):𝐹⟶𝐵)

Proof of Theorem f2ndf

Step	Hyp	Ref	Expression
1		f2ndres 8004	. . 3 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
2		fssxp 6745	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
3		fssres 6757	. . 3 ⊢ (((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵)
4	1, 2, 3	sylancr 586	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵)
5	2	resabs1d 6012	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹) = (2nd ↾ 𝐹))
6	5	eqcomd 2737	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹) = ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹))
7	6	feq1d 6702	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ 𝐹):𝐹⟶𝐵 ↔ ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵))
8	4, 7	mpbird 257	1 ⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹):𝐹⟶𝐵)

Syntax hints:   → wi 4   ⊆ wss 3948   × cxp 5674   ↾ cres 5678  ⟶wf 6539  2^nd c2nd 7978

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-fun 6545  df-fn 6546  df-f 6547  df-2nd 7980

This theorem is referenced by:  fo2ndf  8112  f1o2ndf1  8113