Theorem f2ndf 6466

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 6398	. . 3 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
2		fssxp 5558	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
3		fssres 5568	. . 3 ⊢ (((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵)
4	1, 2, 3	sylancr 418	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵)
5		resabs1 5094	. . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹) = (2nd ↾ 𝐹))
6	2, 5	syl 14	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹) = (2nd ↾ 𝐹))
7	6	eqcomd 2244	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹) = ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹))
8	7	feq1d 5523	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((2nd ↾ 𝐹):𝐹⟶𝐵 ↔ ((2nd ↾ (𝐴 × 𝐵)) ↾ 𝐹):𝐹⟶𝐵))
9	4, 8	mpbird 167	1 ⊢ (𝐹:𝐴⟶𝐵 → (2nd ↾ 𝐹):𝐹⟶𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ⊆ wss 3220   × cxp 4774   ↾ cres 4778  ⟶wf 5376  2^nd c2nd 6377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-2nd 6379

This theorem is used by:  fo2ndf  6467  f1o2ndf1  6468