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

Theorem fconst3m 5778
Description: Two ways to express a constant function. (Contributed by Jim Kingdon, 8-Jan-2019.)
Assertion
Ref Expression
fconst3m  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  A  C_  ( `' F " { B } ) ) ) )
Distinct variable group:    x, A
Allowed substitution hints:    B( x)    F( x)

Proof of Theorem fconst3m
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 fconstfvm 5777 . 2  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  A. y  e.  A  ( F `  y )  =  B ) ) )
2 fnfun 5352 . . . 4  |-  ( F  Fn  A  ->  Fun  F )
3 fndm 5354 . . . . 5  |-  ( F  Fn  A  ->  dom  F  =  A )
4 eqimss2 3235 . . . . 5  |-  ( dom 
F  =  A  ->  A  C_  dom  F )
53, 4syl 14 . . . 4  |-  ( F  Fn  A  ->  A  C_ 
dom  F )
6 funconstss 5677 . . . 4  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( A. y  e.  A  ( F `  y )  =  B  <-> 
A  C_  ( `' F " { B }
) ) )
72, 5, 6syl2anc 411 . . 3  |-  ( F  Fn  A  ->  ( A. y  e.  A  ( F `  y )  =  B  <->  A  C_  ( `' F " { B } ) ) )
87pm5.32i 454 . 2  |-  ( ( F  Fn  A  /\  A. y  e.  A  ( F `  y )  =  B )  <->  ( F  Fn  A  /\  A  C_  ( `' F " { B } ) ) )
91, 8bitrdi 196 1  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  A  C_  ( `' F " { B } ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364   E.wex 1503    e. wcel 2164   A.wral 2472    C_ wss 3154   {csn 3619   `'ccnv 4659   dom cdm 4660   "cima 4663   Fun wfun 5249    Fn wfn 5250   -->wf 5251   ` cfv 5255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2987  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-fo 5261  df-fv 5263
This theorem is referenced by:  fconst4m  5779
  Copyright terms: Public domain W3C validator