| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2ndcof | Structured version Visualization version GIF version | ||
| Description: Composition of the second member function with another function. (Contributed by FL, 15-Oct-2012.) |
| Ref | Expression |
|---|---|
| 2ndcof | ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹):𝐴⟶𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fo2nd 8003 | . . . 4 ⊢ 2nd :V–onto→V | |
| 2 | fofn 6794 | . . . 4 ⊢ (2nd :V–onto→V → 2nd Fn V) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ 2nd Fn V |
| 4 | ffn 6705 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴) | |
| 5 | dffn2 6707 | . . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V) | |
| 6 | 4, 5 | sylib 221 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V) |
| 7 | fnfco 6743 | . . 3 ⊢ ((2nd Fn V ∧ 𝐹:𝐴⟶V) → (2nd ∘ 𝐹) Fn 𝐴) | |
| 8 | 3, 6, 7 | sylancr 598 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹) Fn 𝐴) |
| 9 | rnco 6253 | . . 3 ⊢ ran (2nd ∘ 𝐹) = ran (2nd ↾ ran 𝐹) | |
| 10 | frn 6713 | . . . . 5 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶)) | |
| 11 | ssres2 6003 | . . . . 5 ⊢ (ran 𝐹 ⊆ (𝐵 × 𝐶) → (2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶))) | |
| 12 | rnss 5929 | . . . . 5 ⊢ ((2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶))) | |
| 13 | 10, 11, 12 | 3syl 19 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶))) |
| 14 | f2ndres 8007 | . . . . 5 ⊢ (2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 | |
| 15 | frn 6713 | . . . . 5 ⊢ ((2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 → ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶) | |
| 16 | 14, 15 | ax-mp 5 | . . . 4 ⊢ ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶 |
| 17 | 13, 16 | sstrdi 3949 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ 𝐶) |
| 18 | 9, 17 | eqsstrid 3975 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ∘ 𝐹) ⊆ 𝐶) |
| 19 | df-f 6540 | . 2 ⊢ ((2nd ∘ 𝐹):𝐴⟶𝐶 ↔ ((2nd ∘ 𝐹) Fn 𝐴 ∧ ran (2nd ∘ 𝐹) ⊆ 𝐶)) | |
| 20 | 8, 18, 19 | sylanbrc 594 | 1 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹):𝐴⟶𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 Vcvv 3455 ⊆ wss 3905 × cxp 5659 ran crn 5662 ↾ cres 5663 ∘ ccom 5665 Fn wfn 6531 ⟶wf 6532 –onto→wfo 6534 2nd c2nd 7981 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-fun 6538 df-fn 6539 df-f 6540 df-fo 6542 df-2nd 7983 |
| This theorem is referenced by: axdc4lem 10434 |
| Copyright terms: Public domain | W3C validator |