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

Theorem 2ndcof 6402
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 6396 . . . 4 2nd :V–onto→V
2 fofn 5620 . . . 4 (2nd :V–onto→V → 2nd Fn V)
31, 2ax-mp 5 . . 3 2nd Fn V
4 ffn 5536 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴)
5 dffn2 5538 . . . 4 (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V)
64, 5sylib 122 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V)
7 fnfco 5567 . . 3 ((2nd Fn V ∧ 𝐹:𝐴⟶V) → (2nd ∘ 𝐹) Fn 𝐴)
83, 6, 7sylancr 418 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹) Fn 𝐴)
9 rnco 5297 . . 3 ran (2nd ∘ 𝐹) = ran (2nd ↾ ran 𝐹)
10 frn 5545 . . . . 5 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶))
11 ssres2 5092 . . . . 5 (ran 𝐹 ⊆ (𝐵 × 𝐶) → (2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)))
12 rnss 5014 . . . . 5 ((2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶)))
1310, 11, 123syl 17 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶)))
14 f2ndres 6398 . . . . 5 (2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶
15 frn 5545 . . . . 5 ((2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 → ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶)
1614, 15ax-mp 5 . . . 4 ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶
1713, 16sstrdi 3260 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ 𝐶)
189, 17eqsstrid 3294 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ∘ 𝐹) ⊆ 𝐶)
19 df-f 5384 . 2 ((2nd ∘ 𝐹):𝐴⟶𝐶 ↔ ((2nd ∘ 𝐹) Fn 𝐴 ∧ ran (2nd ∘ 𝐹) ⊆ 𝐶))
208, 18, 19sylanbrc 421 1 (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹):𝐴⟶𝐶)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4  Vcvv 2821   ⊆ wss 3220   × cxp 4774  ran crn 4777   ↾ cres 4778   ∘ ccom 4780   Fn wfn 5375  ⟶wf 5376  –onto→wfo 5378  2nd 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  ax-un 4580
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-fo 5386  df-fv 5388  df-2nd 6379
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator