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

Theorem funssxp 6061
Description: Two ways of specifying a partial function from  A to  B. (Contributed by NM, 13-Nov-2007.)
Assertion
Ref Expression
funssxp  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  <->  ( F : dom  F --> B  /\  dom  F  C_  A )
)

Proof of Theorem funssxp
StepHypRef Expression
1 funfn 5918 . . . . . 6  |-  ( Fun 
F  <->  F  Fn  dom  F )
21biimpi 206 . . . . 5  |-  ( Fun 
F  ->  F  Fn  dom  F )
3 rnss 5354 . . . . . 6  |-  ( F 
C_  ( A  X.  B )  ->  ran  F 
C_  ran  ( A  X.  B ) )
4 rnxpss 5566 . . . . . 6  |-  ran  ( A  X.  B )  C_  B
53, 4syl6ss 3615 . . . . 5  |-  ( F 
C_  ( A  X.  B )  ->  ran  F 
C_  B )
62, 5anim12i 590 . . . 4  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  ( F  Fn  dom  F  /\  ran  F  C_  B )
)
7 df-f 5892 . . . 4  |-  ( F : dom  F --> B  <->  ( F  Fn  dom  F  /\  ran  F 
C_  B ) )
86, 7sylibr 224 . . 3  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  F : dom  F --> B )
9 dmss 5323 . . . . 5  |-  ( F 
C_  ( A  X.  B )  ->  dom  F 
C_  dom  ( A  X.  B ) )
10 dmxpss 5565 . . . . 5  |-  dom  ( A  X.  B )  C_  A
119, 10syl6ss 3615 . . . 4  |-  ( F 
C_  ( A  X.  B )  ->  dom  F 
C_  A )
1211adantl 482 . . 3  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  dom  F 
C_  A )
138, 12jca 554 . 2  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  ( F : dom  F --> B  /\  dom  F  C_  A )
)
14 ffun 6048 . . . 4  |-  ( F : dom  F --> B  ->  Fun  F )
1514adantr 481 . . 3  |-  ( ( F : dom  F --> B  /\  dom  F  C_  A )  ->  Fun  F )
16 fssxp 6060 . . . 4  |-  ( F : dom  F --> B  ->  F  C_  ( dom  F  X.  B ) )
17 xpss1 5228 . . . 4  |-  ( dom 
F  C_  A  ->  ( dom  F  X.  B
)  C_  ( A  X.  B ) )
1816, 17sylan9ss 3616 . . 3  |-  ( ( F : dom  F --> B  /\  dom  F  C_  A )  ->  F  C_  ( A  X.  B
) )
1915, 18jca 554 . 2  |-  ( ( F : dom  F --> B  /\  dom  F  C_  A )  ->  ( Fun  F  /\  F  C_  ( A  X.  B
) ) )
2013, 19impbii 199 1  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  <->  ( F : dom  F --> B  /\  dom  F  C_  A )
)
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    /\ wa 384    C_ wss 3574    X. cxp 5112   dom cdm 5114   ran crn 5115   Fun wfun 5882    Fn wfn 5883   -->wf 5884
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891  df-f 5892
This theorem is referenced by:  elpm2g  7874  volf  23297
  Copyright terms: Public domain W3C validator