| 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 8023 | . . . 4 ⊢ 2nd :V–onto→V | |
| 2 | fofn 6799 | . . . 4 ⊢ (2nd :V–onto→V → 2nd Fn V) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ 2nd Fn V |
| 4 | ffn 6710 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹 Fn 𝐴) | |
| 5 | dffn2 6712 | . . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V) | |
| 6 | 4, 5 | sylib 221 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → 𝐹:𝐴⟶V) |
| 7 | fnfco 6748 | . . 3 ⊢ ((2nd Fn V ∧ 𝐹:𝐴⟶V) → (2nd ∘ 𝐹) Fn 𝐴) | |
| 8 | 3, 6, 7 | sylancr 599 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹) Fn 𝐴) |
| 9 | rnco 6253 | . . 3 ⊢ ran (2nd ∘ 𝐹) = ran (2nd ↾ ran 𝐹) | |
| 10 | frn 6718 | . . . . 5 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran 𝐹 ⊆ (𝐵 × 𝐶)) | |
| 11 | ssres2 5994 | . . . . 5 ⊢ (ran 𝐹 ⊆ (𝐵 × 𝐶) → (2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶))) | |
| 12 | rnss 5920 | . . . . 5 ⊢ ((2nd ↾ ran 𝐹) ⊆ (2nd ↾ (𝐵 × 𝐶)) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶))) | |
| 13 | 10, 11, 12 | 3syl 19 | . . . 4 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ ran (2nd ↾ (𝐵 × 𝐶))) |
| 14 | f2ndres 8027 | . . . . 5 ⊢ (2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 | |
| 15 | frn 6718 | . . . . 5 ⊢ ((2nd ↾ (𝐵 × 𝐶)):(𝐵 × 𝐶)⟶𝐶 → ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶) | |
| 16 | 14, 15 | ax-mp 5 | . . . 4 ⊢ ran (2nd ↾ (𝐵 × 𝐶)) ⊆ 𝐶 |
| 17 | 13, 16 | sstrdi 3920 | . . 3 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ↾ ran 𝐹) ⊆ 𝐶) |
| 18 | 9, 17 | eqsstrid 3946 | . 2 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → ran (2nd ∘ 𝐹) ⊆ 𝐶) |
| 19 | df-f 6543 | . 2 ⊢ ((2nd ∘ 𝐹):𝐴⟶𝐶 ↔ ((2nd ∘ 𝐹) Fn 𝐴 ∧ ran (2nd ∘ 𝐹) ⊆ 𝐶)) | |
| 20 | 8, 18, 19 | sylanbrc 595 | 1 ⊢ (𝐹:𝐴⟶(𝐵 × 𝐶) → (2nd ∘ 𝐹):𝐴⟶𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 Vcvv 3450 ⊆ wss 3895 × cxp 5648 ran crn 5651 ↾ cres 5652 ∘ ccom 5654 Fn wfn 6534 ⟶wf 6535 –onto→wfo 6537 2nd c2nd 8001 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-fun 6541 df-fn 6542 df-f 6543 df-fo 6545 df-2nd 8003 |
| This theorem is used by: axdc4lem 10537 |
| Copyright terms: Public domain | W3C validator |