| 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 7952 | . . . 4 ⊢ 2nd :V–onto→V | |
| 2 | fofn 6742 | . . . 4 ⊢ (2nd :V–onto→V → 2nd Fn V) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ 2nd Fn V |
| 4 | ffn 6656 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴) | |
| 5 | dffn2 6658 | . . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V) | |
| 6 | 4, 5 | sylib 218 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V) |
| 7 | fnfco 6693 | . . 3 ⊢ ((2nd Fn V ∧ 𝐹:𝐴⟶V) → (2nd ∘ 𝐹) Fn 𝐴) | |
| 8 | 3, 6, 7 | sylancr 587 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹) Fn 𝐴) |
| 9 | rnco 6205 | . . 3 ⊢ ran (2nd ∘ 𝐹) = ran (2nd ↾ ran 𝐹) | |
| 10 | frn 6663 | . . . . 5 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶)) | |
| 11 | ssres2 5959 | . . . . 5 ⊢ (ran 𝐹 ⊆ (𝐵 × 𝐶) → (2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶))) | |
| 12 | rnss 5885 | . . . . 5 ⊢ ((2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶))) | |
| 13 | 10, 11, 12 | 3syl 18 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶))) |
| 14 | f2ndres 7956 | . . . . 5 ⊢ (2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 | |
| 15 | frn 6663 | . . . . 5 ⊢ ((2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 → ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶) | |
| 16 | 14, 15 | ax-mp 5 | . . . 4 ⊢ ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶 |
| 17 | 13, 16 | sstrdi 3950 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ 𝐶) |
| 18 | 9, 17 | eqsstrid 3976 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ∘ 𝐹) ⊆ 𝐶) |
| 19 | df-f 6490 | . 2 ⊢ ((2nd ∘ 𝐹):𝐴⟶𝐶 ↔ ((2nd ∘ 𝐹) Fn 𝐴 ∧ ran (2nd ∘ 𝐹) ⊆ 𝐶)) | |
| 20 | 8, 18, 19 | sylanbrc 583 | 1 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹):𝐴⟶𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 Vcvv 3438 ⊆ wss 3905 × cxp 5621 ran crn 5624 ↾ cres 5625 ∘ ccom 5627 Fn wfn 6481 ⟶wf 6482 –onto→wfo 6484 2nd c2nd 7930 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 ax-un 7675 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-fun 6488 df-fn 6489 df-f 6490 df-fo 6492 df-2nd 7932 |
| This theorem is referenced by: axdc4lem 10368 |
| Copyright terms: Public domain | W3C validator |