Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnresfnco Structured version   Visualization version   GIF version

Theorem fnresfnco 47287
Description: Composition of two functions, similar to fnco 6610. (Contributed by Alexander van der Vekens, 25-Jul-2017.)
Assertion
Ref Expression
fnresfnco (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → (𝐹𝐺) Fn 𝐵)

Proof of Theorem fnresfnco
StepHypRef Expression
1 fnfun 6592 . . 3 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → Fun (𝐹 ↾ ran 𝐺))
2 fnfun 6592 . . 3 (𝐺 Fn 𝐵 → Fun 𝐺)
3 funresfunco 6533 . . 3 ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹𝐺))
41, 2, 3syl2an 596 . 2 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → Fun (𝐹𝐺))
5 fndm 6595 . . . . . 6 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → dom (𝐹 ↾ ran 𝐺) = ran 𝐺)
6 dmres 5971 . . . . . . . 8 dom (𝐹 ↾ ran 𝐺) = (ran 𝐺 ∩ dom 𝐹)
76eqeq1i 2741 . . . . . . 7 (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
8 dfss2 3919 . . . . . . 7 (ran 𝐺 ⊆ dom 𝐹 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
97, 8sylbb2 238 . . . . . 6 (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 → ran 𝐺 ⊆ dom 𝐹)
105, 9syl 17 . . . . 5 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → ran 𝐺 ⊆ dom 𝐹)
1110adantr 480 . . . 4 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → ran 𝐺 ⊆ dom 𝐹)
12 dmcosseq 5927 . . . 4 (ran 𝐺 ⊆ dom 𝐹 → dom (𝐹𝐺) = dom 𝐺)
1311, 12syl 17 . . 3 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → dom (𝐹𝐺) = dom 𝐺)
14 fndm 6595 . . . 4 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
1514adantl 481 . . 3 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → dom 𝐺 = 𝐵)
1613, 15eqtrd 2771 . 2 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → dom (𝐹𝐺) = 𝐵)
17 df-fn 6495 . 2 ((𝐹𝐺) Fn 𝐵 ↔ (Fun (𝐹𝐺) ∧ dom (𝐹𝐺) = 𝐵))
184, 16, 17sylanbrc 583 1 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → (𝐹𝐺) Fn 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  cin 3900  wss 3901  dom cdm 5624  ran crn 5625  cres 5626  ccom 5628  Fun wfun 6486   Fn wfn 6487
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-fun 6494  df-fn 6495
This theorem is referenced by:  funcoressn  47288
  Copyright terms: Public domain W3C validator