| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1stcof | Structured version Visualization version GIF version | ||
| Description: Composition of the first member function with another function. (Contributed by NM, 12-Oct-2007.) |
| Ref | Expression |
|---|---|
| 1stcof | ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (1st ∘ 𝐹):𝐴⟶𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fo1st 7955 | . . . 4 ⊢ 1st :V–onto→V | |
| 2 | fofn 6749 | . . . 4 ⊢ (1st :V–onto→V → 1st Fn V) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ 1st Fn V |
| 4 | ffn 6663 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴) | |
| 5 | dffn2 6665 | . . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V) | |
| 6 | 4, 5 | sylib 218 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V) |
| 7 | fnfco 6700 | . . 3 ⊢ ((1st Fn V ∧ 𝐹:𝐴⟶V) → (1st ∘ 𝐹) Fn 𝐴) | |
| 8 | 3, 6, 7 | sylancr 588 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (1st ∘ 𝐹) Fn 𝐴) |
| 9 | rnco 6211 | . . 3 ⊢ ran (1st ∘ 𝐹) = ran (1st ↾ ran 𝐹) | |
| 10 | frn 6670 | . . . . 5 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶)) | |
| 11 | ssres2 5964 | . . . . 5 ⊢ (ran 𝐹 ⊆ (𝐵 × 𝐶) → (1st ↾ ran 𝐹) ⊆ (1st ↾ (𝐵 × 𝐶))) | |
| 12 | rnss 5889 | . . . . 5 ⊢ ((1st ↾ ran 𝐹) ⊆ (1st ↾ (𝐵 × 𝐶)) → ran (1st ↾ ran 𝐹) ⊆ ran (1st ↾ (𝐵 × 𝐶))) | |
| 13 | 10, 11, 12 | 3syl 18 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (1st ↾ ran 𝐹) ⊆ ran (1st ↾ (𝐵 × 𝐶))) |
| 14 | f1stres 7959 | . . . . 5 ⊢ (1st ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐵 | |
| 15 | frn 6670 | . . . . 5 ⊢ ((1st ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐵 → ran (1st ↾ (𝐵 × 𝐶)) ⊆ 𝐵) | |
| 16 | 14, 15 | ax-mp 5 | . . . 4 ⊢ ran (1st ↾ (𝐵 × 𝐶)) ⊆ 𝐵 |
| 17 | 13, 16 | sstrdi 3947 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (1st ↾ ran 𝐹) ⊆ 𝐵) |
| 18 | 9, 17 | eqsstrid 3973 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (1st ∘ 𝐹) ⊆ 𝐵) |
| 19 | df-f 6497 | . 2 ⊢ ((1st ∘ 𝐹):𝐴⟶𝐵 ↔ ((1st ∘ 𝐹) Fn 𝐴 ∧ ran (1st ∘ 𝐹) ⊆ 𝐵)) | |
| 20 | 8, 18, 19 | sylanbrc 584 | 1 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (1st ∘ 𝐹):𝐴⟶𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 Vcvv 3441 ⊆ wss 3902 × cxp 5623 ran crn 5626 ↾ cres 5627 ∘ ccom 5629 Fn wfn 6488 ⟶wf 6489 –onto→wfo 6491 1st c1st 7933 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-fun 6495 df-fn 6496 df-f 6497 df-fo 6499 df-1st 7935 |
| This theorem is referenced by: ruclem11 16169 ruclem12 16170 caubl 25268 |
| Copyright terms: Public domain | W3C validator |