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

Theorem fconst4m 5633
Description: Two ways to express a constant function. (Contributed by NM, 8-Mar-2007.)
Assertion
Ref Expression
fconst4m  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  ( `' F " { B } )  =  A ) ) )
Distinct variable group:    x, A
Allowed substitution hints:    B( x)    F( x)

Proof of Theorem fconst4m
StepHypRef Expression
1 fconst3m 5632 . 2  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  A  C_  ( `' F " { B } ) ) ) )
2 cnvimass 4897 . . . . . 6  |-  ( `' F " { B } )  C_  dom  F
3 fndm 5217 . . . . . 6  |-  ( F  Fn  A  ->  dom  F  =  A )
42, 3sseqtrid 3142 . . . . 5  |-  ( F  Fn  A  ->  ( `' F " { B } )  C_  A
)
54biantrurd 303 . . . 4  |-  ( F  Fn  A  ->  ( A  C_  ( `' F " { B } )  <-> 
( ( `' F " { B } ) 
C_  A  /\  A  C_  ( `' F " { B } ) ) ) )
6 eqss 3107 . . . 4  |-  ( ( `' F " { B } )  =  A  <-> 
( ( `' F " { B } ) 
C_  A  /\  A  C_  ( `' F " { B } ) ) )
75, 6syl6bbr 197 . . 3  |-  ( F  Fn  A  ->  ( A  C_  ( `' F " { B } )  <-> 
( `' F " { B } )  =  A ) )
87pm5.32i 449 . 2  |-  ( ( F  Fn  A  /\  A  C_  ( `' F " { B } ) )  <->  ( F  Fn  A  /\  ( `' F " { B } )  =  A ) )
91, 8syl6bb 195 1  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  ( `' F " { B } )  =  A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480    C_ wss 3066   {csn 3522   `'ccnv 4533   dom cdm 4534   "cima 4537    Fn wfn 5113   -->wf 5114
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-fo 5124  df-fv 5126
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator