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

Theorem funres11 6613
Description: The restriction of a one-to-one function is one-to-one. (Contributed by NM, 25-Mar-1998.)
Assertion
Ref Expression
funres11 (Fun 𝐹 → Fun (𝐹𝐴))

Proof of Theorem funres11
StepHypRef Expression
1 resss 6000 . 2 (𝐹𝐴) ⊆ 𝐹
2 cnvss 5858 . 2 ((𝐹𝐴) ⊆ 𝐹(𝐹𝐴) ⊆ 𝐹)
3 funss 6555 . 2 ((𝐹𝐴) ⊆ 𝐹 → (Fun 𝐹 → Fun (𝐹𝐴)))
41, 2, 3mp2b 10 1 (Fun 𝐹 → Fun (𝐹𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wss 3905  ccnv 5660  cres 5663  Fun wfun 6530
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-in 3912  df-ss 3922  df-br 5110  df-opab 5174  df-rel 5668  df-cnv 5669  df-co 5670  df-res 5673  df-fun 6538
This theorem is referenced by:  f1ssres  6783  resdif  6842  f1ssf1  6853  f1oi  6859  resf1extb  7927  ssdomg  8993  sbthlem8  9078  spthispth  30073
  Copyright terms: Public domain W3C validator