Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  2ndcof GIF version

Theorem 2ndcof 5818
 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 5812 . . . 4 2nd :V–onto→V
2 fofn 5135 . . . 4 (2nd :V–onto→V → 2nd Fn V)
31, 2ax-mp 7 . . 3 2nd Fn V
4 ffn 5073 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴)
5 dffn2 5074 . . . 4 (𝐹 Fn 𝐴𝐹:𝐴⟶V)
64, 5sylib 131 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V)
7 fnfco 5092 . . 3 ((2nd Fn V ∧ 𝐹:𝐴⟶V) → (2nd𝐹) Fn 𝐴)
83, 6, 7sylancr 399 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd𝐹) Fn 𝐴)
9 rnco 4854 . . 3 ran (2nd𝐹) = ran (2nd ↾ ran 𝐹)
10 frn 5079 . . . . 5 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶))
11 ssres2 4665 . . . . 5 (ran 𝐹 ⊆ (𝐵 × 𝐶) → (2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)))
12 rnss 4591 . . . . 5 ((2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶)))
1310, 11, 123syl 17 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶)))
14 f2ndres 5814 . . . . 5 (2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶
15 frn 5079 . . . . 5 ((2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 → ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶)
1614, 15ax-mp 7 . . . 4 ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶
1713, 16syl6ss 2984 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ 𝐶)
189, 17syl5eqss 3016 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd𝐹) ⊆ 𝐶)
19 df-f 4933 . 2 ((2nd𝐹):𝐴𝐶 ↔ ((2nd𝐹) Fn 𝐴 ∧ ran (2nd𝐹) ⊆ 𝐶))
208, 18, 19sylanbrc 402 1 (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd𝐹):𝐴𝐶)
 Colors of variables: wff set class Syntax hints:   → wi 4  Vcvv 2574   ⊆ wss 2944   × cxp 4370  ran crn 4373   ↾ cres 4374   ∘ ccom 4376   Fn wfn 4924  ⟶wf 4925  –onto→wfo 4927  2nd c2nd 5793 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-fo 4935  df-fv 4937  df-2nd 5795 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator