Theorem f2ndf 8133

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 8026	. . 3 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
2		fssxp 6737	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
3		fssres 6748	. . 3 ⊢ (((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵)
4	1, 2, 3	sylancr 599	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵)
5	2	resabs1d 5998	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹) = (2nd ↾ 𝐹))
6	5	eqcomd 2766	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹) = ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹))
7	6	feq1d 6691	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ 𝐹):𝐹⟶𝐵 ↔ ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵))
8	4, 7	mpbird 260	1 ⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹):𝐹⟶𝐵)

This proof depends on syntax axioms:   → wi 4   ⊆ wss 3895   × cxp 5648   ↾ cres 5652  ⟶wf 6534  2^nd c2nd 8000

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-fun 6540  df-fn 6541  df-f 6542  df-2nd 8002

This theorem is used by:  fo2ndf  8134  f1o2ndf1  8135