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

Theorem 1stcof 5992
Description: Composition of the first member function with another function. (Contributed by NM, 12-Oct-2007.)
Assertion
Ref Expression
1stcof (𝐹:𝐴⟶(𝐵 × 𝐶) → (1st𝐹):𝐴𝐵)

Proof of Theorem 1stcof
StepHypRef Expression
1 fo1st 5986 . . . 4 1st :V–onto→V
2 fofn 5283 . . . 4 (1st :V–onto→V → 1st Fn V)
31, 2ax-mp 7 . . 3 1st Fn V
4 ffn 5208 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴)
5 dffn2 5210 . . . 4 (𝐹 Fn 𝐴𝐹:𝐴⟶V)
64, 5sylib 121 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V)
7 fnfco 5233 . . 3 ((1st Fn V ∧ 𝐹:𝐴⟶V) → (1st𝐹) Fn 𝐴)
83, 6, 7sylancr 408 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → (1st𝐹) Fn 𝐴)
9 rnco 4981 . . 3 ran (1st𝐹) = ran (1st ↾ ran 𝐹)
10 frn 5217 . . . . 5 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶))
11 ssres2 4782 . . . . 5 (ran 𝐹 ⊆ (𝐵 × 𝐶) → (1st ↾ ran 𝐹) ⊆ (1st ↾ (𝐵 × 𝐶)))
12 rnss 4707 . . . . 5 ((1st ↾ ran 𝐹) ⊆ (1st ↾ (𝐵 × 𝐶)) → ran (1st ↾ ran 𝐹) ⊆ ran (1st ↾ (𝐵 × 𝐶)))
1310, 11, 123syl 17 . . . 4 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (1st ↾ ran 𝐹) ⊆ ran (1st ↾ (𝐵 × 𝐶)))
14 f1stres 5988 . . . . 5 (1st ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐵
15 frn 5217 . . . . 5 ((1st ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐵 → ran (1st ↾ (𝐵 × 𝐶)) ⊆ 𝐵)
1614, 15ax-mp 7 . . . 4 ran (1st ↾ (𝐵 × 𝐶)) ⊆ 𝐵
1713, 16syl6ss 3059 . . 3 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (1st ↾ ran 𝐹) ⊆ 𝐵)
189, 17syl5eqss 3093 . 2 (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (1st𝐹) ⊆ 𝐵)
19 df-f 5063 . 2 ((1st𝐹):𝐴𝐵 ↔ ((1st𝐹) Fn 𝐴 ∧ ran (1st𝐹) ⊆ 𝐵))
208, 18, 19sylanbrc 411 1 (𝐹:𝐴⟶(𝐵 × 𝐶) → (1st𝐹):𝐴𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  Vcvv 2641  wss 3021   × cxp 4475  ran crn 4478  cres 4479  ccom 4481   Fn wfn 5054  wf 5055  ontowfo 5057  1st c1st 5967
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-pow 4038  ax-pr 4069  ax-un 4293
This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-rab 2384  df-v 2643  df-sbc 2863  df-csb 2956  df-un 3025  df-in 3027  df-ss 3034  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-iun 3762  df-br 3876  df-opab 3930  df-mpt 3931  df-id 4153  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-fo 5065  df-fv 5067  df-1st 5969
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator