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 48314
Description: Composition of two functions, similar to fnco 6676. (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 6658 . . 3 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → Fun (𝐹 ↾ ran 𝐺))
2 fnfun 6658 . . 3 (𝐺 Fn 𝐵 → Fun 𝐺)
3 funresfunco 6598 . . 3 ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺))
41, 2, 3syl2an 608 . 2 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → Fun (𝐹 ∘ 𝐺))
5 fndm 6661 . . . . . 6 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → dom (𝐹 ↾ ran 𝐺) = ran 𝐺)
6 dmres 6014 . . . . . . . 8 dom (𝐹 ↾ ran 𝐺) = (ran 𝐺 ∩ dom 𝐹)
76eqeq1i 2768 . . . . . . 7 (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
8 dfss2 4097 . . . . . . 7 (ran 𝐺 ⊆ dom 𝐹 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
97, 8sylbb2 241 . . . . . 6 (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 → ran 𝐺 ⊆ dom 𝐹)
105, 9syl 18 . . . . 5 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → ran 𝐺 ⊆ dom 𝐹)
1110adantr 486 . . . 4 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → ran 𝐺 ⊆ dom 𝐹)
12 dmcosseq 5966 . . . 4 (ran 𝐺 ⊆ dom 𝐹 → dom (𝐹 ∘ 𝐺) = dom 𝐺)
1311, 12syl 18 . . 3 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom (𝐹 ∘ 𝐺) = dom 𝐺)
14 fndm 6661 . . . 4 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
1514adantl 487 . . 3 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom 𝐺 = 𝐵)
1613, 15eqtrd 2798 . 2 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺 ∧ 𝐺 Fn 𝐵) → dom (𝐹 ∘ 𝐺) = 𝐵)
17 df-fn 6558 . 2 ((𝐹 ∘ 𝐺) Fn 𝐵 ↔ (Fun (𝐹 ∘ 𝐺) ∧ dom (𝐹 ∘ 𝐺) = 𝐵))
184, 16, 17sylanbrc 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   ⊆ wss 3900   ∩ cin 4092  dom cdm 5655  ran crn 5656   ↾ cres 5657   ∘ ccom 5659  Fun wfun 6549   Fn wfn 6550
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395
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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  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 6557  df-fn 6558
This theorem is used by:  funcoressn  48315
  Copyright terms: Public domain W3C validator