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 47042
Description: Composition of two functions, similar to fnco 6636. (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 6618 . . 3 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → Fun (𝐹 ↾ ran 𝐺))
2 fnfun 6618 . . 3 (𝐺 Fn 𝐵 → Fun 𝐺)
3 funresfunco 6557 . . 3 ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹𝐺))
41, 2, 3syl2an 596 . 2 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → Fun (𝐹𝐺))
5 fndm 6621 . . . . . 6 ((𝐹 ↾ ran 𝐺) Fn ran 𝐺 → dom (𝐹 ↾ ran 𝐺) = ran 𝐺)
6 dmres 5983 . . . . . . . 8 dom (𝐹 ↾ ran 𝐺) = (ran 𝐺 ∩ dom 𝐹)
76eqeq1i 2734 . . . . . . 7 (dom (𝐹 ↾ ran 𝐺) = ran 𝐺 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
8 dfss2 3932 . . . . . . 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 5940 . . . 4 (ran 𝐺 ⊆ dom 𝐹 → dom (𝐹𝐺) = dom 𝐺)
1311, 12syl 17 . . 3 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → dom (𝐹𝐺) = dom 𝐺)
14 fndm 6621 . . . 4 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
1514adantl 481 . . 3 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → dom 𝐺 = 𝐵)
1613, 15eqtrd 2764 . 2 (((𝐹 ↾ ran 𝐺) Fn ran 𝐺𝐺 Fn 𝐵) → dom (𝐹𝐺) = 𝐵)
17 df-fn 6514 . 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 1540  cin 3913  wss 3914  dom cdm 5638  ran crn 5639  cres 5640  ccom 5642  Fun wfun 6505   Fn wfn 6506
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-fun 6513  df-fn 6514
This theorem is referenced by:  funcoressn  47043
  Copyright terms: Public domain W3C validator