MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2ndcof Structured version   Visualization version   GIF version

Theorem 2ndcof 8061
Description: Composition of the second member function with another function. (Contributed by FL, 15-Oct-2012.)
Assertion
Ref Expression
2ndcof (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd𝐹):𝐴𝐶)

Proof of Theorem 2ndcof
StepHypRef Expression
1 fo2nd 8051 . . . 4 2nd :V–onto→V
2 fofn 6836 . . . 4 (2nd :V–onto→V → 2nd Fn V)
31, 2ax-mp 5 . . 3 2nd Fn V
4 ffn 6747 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴)
5 dffn2 6749 . . . 4 (𝐹 Fn 𝐴𝐹:𝐴⟶V)
64, 5sylib 218 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V)
7 fnfco 6786 . . 3 ((2nd Fn V ∧ 𝐹:𝐴⟶V) → (2nd𝐹) Fn 𝐴)
83, 6, 7sylancr 586 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd𝐹) Fn 𝐴)
9 rnco 6283 . . 3 ran (2nd𝐹) = ran (2nd ↾ ran 𝐹)
10 frn 6754 . . . . 5 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶))
11 ssres2 6034 . . . . 5 (ran 𝐹 ⊆ (𝐵 × 𝐶) → (2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)))
12 rnss 5964 . . . . 5 ((2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶)))
1310, 11, 123syl 18 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶)))
14 f2ndres 8055 . . . . 5 (2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶
15 frn 6754 . . . . 5 ((2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 → ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶)
1614, 15ax-mp 5 . . . 4 ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶
1713, 16sstrdi 4021 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ 𝐶)
189, 17eqsstrid 4057 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd𝐹) ⊆ 𝐶)
19 df-f 6577 . 2 ((2nd𝐹):𝐴𝐶 ↔ ((2nd𝐹) Fn 𝐴 ∧ ran (2nd𝐹) ⊆ 𝐶))
208, 18, 19sylanbrc 582 1 (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd𝐹):𝐴𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  Vcvv 3488  wss 3976   × cxp 5698  ran crn 5701  cres 5702  ccom 5704   Fn wfn 6568  wf 6569  ontowfo 6571  2nd c2nd 8029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-fun 6575  df-fn 6576  df-f 6577  df-fo 6579  df-2nd 8031
This theorem is referenced by:  axdc4lem  10524
  Copyright terms: Public domain W3C validator