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

Theorem fnssresb 6614
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 6495 . 2 ((𝐹𝐵) Fn 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵))
2 fnfun 6592 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
32funresd 6535 . . . 4 (𝐹 Fn 𝐴 → Fun (𝐹𝐵))
43biantrurd 532 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵)))
5 ssdmres 5972 . . . 4 (𝐵 ⊆ dom 𝐹 ↔ dom (𝐹𝐵) = 𝐵)
6 fndm 6595 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
76sseq2d 3955 . . . 4 (𝐹 Fn 𝐴 → (𝐵 ⊆ dom 𝐹𝐵𝐴))
85, 7bitr3id 285 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵𝐵𝐴))
94, 8bitr3d 281 . 2 (𝐹 Fn 𝐴 → ((Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵) ↔ 𝐵𝐴))
101, 9bitrid 283 1 (𝐹 Fn 𝐴 → ((𝐹𝐵) Fn 𝐵𝐵𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wss 3890  dom cdm 5624  cres 5626  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 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-res 5636  df-fun 6494  df-fn 6495
This theorem is referenced by:  fnssres  6615  wrdred1hash  14514  rhmsscrnghm  20633  rngcrescrhm  20652  plyreres  26259  xrge0pluscn  34100  icoreresf  37682  fnbrafvb  47614  rngcrescrhmALTV  48768
  Copyright terms: Public domain W3C validator