ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fnssresb GIF version

Theorem fnssresb 5300
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 5191 . 2 ((𝐹𝐵) Fn 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵))
2 fnfun 5285 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
3 funres 5229 . . . . 5 (Fun 𝐹 → Fun (𝐹𝐵))
42, 3syl 14 . . . 4 (𝐹 Fn 𝐴 → Fun (𝐹𝐵))
54biantrurd 303 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵 ↔ (Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵)))
6 ssdmres 4906 . . . 4 (𝐵 ⊆ dom 𝐹 ↔ dom (𝐹𝐵) = 𝐵)
7 fndm 5287 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
87sseq2d 3172 . . . 4 (𝐹 Fn 𝐴 → (𝐵 ⊆ dom 𝐹𝐵𝐴))
96, 8bitr3id 193 . . 3 (𝐹 Fn 𝐴 → (dom (𝐹𝐵) = 𝐵𝐵𝐴))
105, 9bitr3d 189 . 2 (𝐹 Fn 𝐴 → ((Fun (𝐹𝐵) ∧ dom (𝐹𝐵) = 𝐵) ↔ 𝐵𝐴))
111, 10syl5bb 191 1 (𝐹 Fn 𝐴 → ((𝐹𝐵) Fn 𝐵𝐵𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1343  wss 3116  dom cdm 4604  cres 4606  Fun wfun 5182   Fn wfn 5183
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-res 4616  df-fun 5190  df-fn 5191
This theorem is referenced by:  fnssres  5301
  Copyright terms: Public domain W3C validator