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

Theorem fnssresb 6658
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 6540 . 2 ((𝐹𝐵) Fn 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵))
2 fnfun 6636 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
32funresd 6580 . . . 4 (𝐹 Fn 𝐴 → Fun (𝐹𝐵))
43biantrurd 541 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵)))
5 ssdmres 6013 . . . 4 (𝐵 ⊆ dom 𝐹 ↔ dom (𝐹𝐵) = 𝐵)
6 fndm 6639 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
76sseq2d 3977 . . . 4 (𝐹 Fn 𝐴 → (𝐵 ⊆ dom 𝐹𝐵𝐴))
85, 7bitr3id 288 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵𝐵𝐴))
94, 8bitr3d 284 . 2 (𝐹 Fn 𝐴 → ((Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵) ↔ 𝐵𝐴))
101, 9bitrid 286 1 (𝐹 Fn 𝐴 → ((𝐹𝐵) Fn 𝐵𝐵𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wss 3913  dom cdm 5662  cres 5664  Fun wfun 6531   Fn wfn 6532
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-res 5674  df-fun 6539  df-fn 6540
This theorem is referenced by:  fnssres  6659  wrdred1hash  14597  rhmsscrnghm  20749  rngcrescrhm  20768  plyreres  26412  xrge0pluscn  34274  icoreresf  37885  fnbrafvb  47779  rngcrescrhmALTV  48933
  Copyright terms: Public domain W3C validator