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

Theorem funssxp 5557
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 5407 . . . . . 6  |-  ( Fun 
F  <->  F  Fn  dom  F )
21biimpi 120 . . . . 5  |-  ( Fun 
F  ->  F  Fn  dom  F )
3 rnss 5012 . . . . . 6  |-  ( F 
C_  ( A  X.  B )  ->  ran  F 
C_  ran  ( A  X.  B ) )
4 rnxpss 5219 . . . . . 6  |-  ran  ( A  X.  B )  C_  B
53, 4sstrdi 3260 . . . . 5  |-  ( F 
C_  ( A  X.  B )  ->  ran  F 
C_  B )
62, 5anim12i 338 . . . 4  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  ( F  Fn  dom  F  /\  ran  F  C_  B )
)
7 df-f 5381 . . . 4  |-  ( F : dom  F --> B  <->  ( F  Fn  dom  F  /\  ran  F 
C_  B ) )
86, 7sylibr 134 . . 3  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  F : dom  F --> B )
9 dmss 4980 . . . . 5  |-  ( F 
C_  ( A  X.  B )  ->  dom  F 
C_  dom  ( A  X.  B ) )
10 dmxpss 5218 . . . . 5  |-  dom  ( A  X.  B )  C_  A
119, 10sstrdi 3260 . . . 4  |-  ( F 
C_  ( A  X.  B )  ->  dom  F 
C_  A )
1211adantl 277 . . 3  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  dom  F 
C_  A )
138, 12jca 306 . 2  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  ->  ( F : dom  F --> B  /\  dom  F  C_  A )
)
14 ffun 5536 . . . 4  |-  ( F : dom  F --> B  ->  Fun  F )
1514adantr 276 . . 3  |-  ( ( F : dom  F --> B  /\  dom  F  C_  A )  ->  Fun  F )
16 fssxp 5555 . . . 4  |-  ( F : dom  F --> B  ->  F  C_  ( dom  F  X.  B ) )
17 xpss1 4885 . . . 4  |-  ( dom 
F  C_  A  ->  ( dom  F  X.  B
)  C_  ( A  X.  B ) )
1816, 17sylan9ss 3261 . . 3  |-  ( ( F : dom  F --> B  /\  dom  F  C_  A )  ->  F  C_  ( A  X.  B
) )
1915, 18jca 306 . 2  |-  ( ( F : dom  F --> B  /\  dom  F  C_  A )  ->  ( Fun  F  /\  F  C_  ( A  X.  B
) ) )
2013, 19impbii 126 1  |-  ( ( Fun  F  /\  F  C_  ( A  X.  B
) )  <->  ( F : dom  F --> B  /\  dom  F  C_  A )
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    <-> wb 105    C_ wss 3220    X. cxp 4772   dom cdm 4774   ran crn 4775   Fun wfun 5371    Fn wfn 5372   -->wf 5373
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-dm 4784  df-rn 4785  df-fun 5379  df-fn 5380  df-f 5381
This theorem is used by:  elpm2g  6939  casef  7428
  Copyright terms: Public domain W3C validator