| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fnresfnco | Structured version Visualization version GIF version | ||
| Description: Composition of two functions, similar to fnco 6653. (Contributed by Alexander van der Vekens, 25-Jul-2017.) |
| Ref | Expression |
|---|---|
| fnresfnco | ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → (𝐹 ∘ 𝐺) Fn 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnfun 6635 | . . 3 ⊢ ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → Fun (𝐹 ↾ ran 𝐺)) | |
| 2 | fnfun 6635 | . . 3 ⊢ (𝐺 Fn 𝐵 → Fun 𝐺) | |
| 3 | funresfunco 6577 | . . 3 ⊢ ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺)) | |
| 4 | 1, 2, 3 | syl2an 608 | . 2 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → Fun (𝐹 ∘ 𝐺)) |
| 5 | fndm 6638 | . . . . . 6 ⊢ ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → dom (𝐹 ↾ ran 𝐺) = ran 𝐺) | |
| 6 | dmres 6007 | . . . . . . . 8 ⊢ dom (𝐹 ↾ ran 𝐺) = (ran 𝐺 ∩ dom 𝐹) | |
| 7 | 6 | eqeq1i 2765 | . . . . . . 7 ⊢ (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺) |
| 8 | dfss2 3917 | . . . . . . 7 ⊢ (ran 𝐺 ⊆ dom 𝐹 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺) | |
| 9 | 7, 8 | sylbb2 241 | . . . . . 6 ⊢ (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 → ran 𝐺 ⊆ dom 𝐹) |
| 10 | 5, 9 | syl 18 | . . . . 5 ⊢ ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → ran 𝐺 ⊆ dom 𝐹) |
| 11 | 10 | adantr 486 | . . . 4 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → ran 𝐺 ⊆ dom 𝐹) |
| 12 | dmcosseq 5964 | . . . 4 ⊢ (ran 𝐺 ⊆ dom 𝐹 → dom (𝐹 ∘ 𝐺) = dom 𝐺) | |
| 13 | 11, 12 | syl 18 | . . 3 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom (𝐹 ∘ 𝐺) = dom 𝐺) |
| 14 | fndm 6638 | . . . 4 ⊢ (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵) | |
| 15 | 14 | adantl 487 | . . 3 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom 𝐺 = 𝐵) |
| 16 | 13, 15 | eqtrd 2795 | . 2 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom (𝐹 ∘ 𝐺) = 𝐵) |
| 17 | df-fn 6538 | . 2 ⊢ ((𝐹 ∘ 𝐺) Fn 𝐵 ↔ (Fun (𝐹 ∘ 𝐺) ∧ dom (𝐹 ∘ 𝐺) = 𝐵)) | |
| 18 | 4, 16, 17 | sylanbrc 595 | 1 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → (𝐹 ∘ 𝐺) Fn 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∩ cin 3898 ⊆ wss 3899 dom cdm 5655 ran crn 5656 ↾ cres 5657 ∘ ccom 5659 Fun wfun 6529 Fn wfn 6530 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-fun 6537 df-fn 6538 |
| This theorem is used by: funcoressn 47995 |
| Copyright terms: Public domain | W3C validator |