MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnssresb Structured version   Visualization version   GIF version

Theorem fnssresb 6538
Description: Restriction of a function with a subclass of its domain. (Contributed by NM, 10-Oct-2007.)
Assertion
Ref Expression
fnssresb (𝐹 Fn 𝐴 → ((𝐹𝐵) Fn 𝐵𝐵𝐴))

Proof of Theorem fnssresb
StepHypRef Expression
1 df-fn 6421 . 2 ((𝐹𝐵) Fn 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵))
2 fnfun 6517 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
32funresd 6461 . . . 4 (𝐹 Fn 𝐴 → Fun (𝐹𝐵))
43biantrurd 532 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵)))
5 ssdmres 5903 . . . 4 (𝐵 ⊆ dom 𝐹 ↔ dom (𝐹𝐵) = 𝐵)
6 fndm 6520 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
76sseq2d 3949 . . . 4 (𝐹 Fn 𝐴 → (𝐵 ⊆ dom 𝐹𝐵𝐴))
85, 7bitr3id 284 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵𝐵𝐴))
94, 8bitr3d 280 . 2 (𝐹 Fn 𝐴 → ((Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵) ↔ 𝐵𝐴))
101, 9syl5bb 282 1 (𝐹 Fn 𝐴 → ((𝐹𝐵) Fn 𝐵𝐵𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wss 3883  dom cdm 5580  cres 5582  Fun wfun 6412   Fn wfn 6413
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-res 5592  df-fun 6420  df-fn 6421
This theorem is referenced by:  fnssres  6539  wrdred1hash  14192  plyreres  25348  xrge0pluscn  31792  icoreresf  35450  fnbrafvb  44533  rhmsscrnghm  45472  rngcrescrhm  45531  rngcrescrhmALTV  45549
  Copyright terms: Public domain W3C validator