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 5999. (Contributed by Alexander van der Vekens, 25-Jul-2017.) |
Ref | Expression |
---|---|
fnresfnco | ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → (𝐹 ∘ 𝐺) Fn 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnfun 5988 | . . 3 ⊢ ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → Fun (𝐹 ↾ ran 𝐺)) | |
2 | fnfun 5988 | . . 3 ⊢ (𝐺 Fn 𝐵 → Fun 𝐺) | |
3 | funresfunco 41205 | . . 3 ⊢ ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺)) | |
4 | 1, 2, 3 | syl2an 494 | . 2 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → Fun (𝐹 ∘ 𝐺)) |
5 | fndm 5990 | . . . . . 6 ⊢ ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → dom (𝐹 ↾ ran 𝐺) = ran 𝐺) | |
6 | dmres 5419 | . . . . . . . 8 ⊢ dom (𝐹 ↾ ran 𝐺) = (ran 𝐺 ∩ dom 𝐹) | |
7 | 6 | eqeq1i 2627 | . . . . . . 7 ⊢ (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺) |
8 | df-ss 3588 | . . . . . . 7 ⊢ (ran 𝐺 ⊆ dom 𝐹 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺) | |
9 | 7, 8 | sylbb2 228 | . . . . . 6 ⊢ (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 → ran 𝐺 ⊆ dom 𝐹) |
10 | 5, 9 | syl 17 | . . . . 5 ⊢ ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → ran 𝐺 ⊆ dom 𝐹) |
11 | 10 | adantr 481 | . . . 4 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → ran 𝐺 ⊆ dom 𝐹) |
12 | dmcosseq 5387 | . . . 4 ⊢ (ran 𝐺 ⊆ dom 𝐹 → dom (𝐹 ∘ 𝐺) = dom 𝐺) | |
13 | 11, 12 | syl 17 | . . 3 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom (𝐹 ∘ 𝐺) = dom 𝐺) |
14 | fndm 5990 | . . . 4 ⊢ (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵) | |
15 | 14 | adantl 482 | . . 3 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom 𝐺 = 𝐵) |
16 | 13, 15 | eqtrd 2656 | . 2 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom (𝐹 ∘ 𝐺) = 𝐵) |
17 | df-fn 5891 | . 2 ⊢ ((𝐹 ∘ 𝐺) Fn 𝐵 ↔ (Fun (𝐹 ∘ 𝐺) ∧ dom (𝐹 ∘ 𝐺) = 𝐵)) | |
18 | 4, 16, 17 | sylanbrc 698 | 1 ⊢ (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → (𝐹 ∘ 𝐺) Fn 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∩ cin 3573 ⊆ wss 3574 dom cdm 5114 ran crn 5115 ↾ cres 5116 ∘ ccom 5118 Fun wfun 5882 Fn wfn 5883 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-fun 5890 df-fn 5891 |
This theorem is referenced by: funcoressn 41207 |
Copyright terms: Public domain | W3C validator |