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

Theorem fconst3m 5872
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 5871 . 2  |-  ( E. x  x  e.  A  ->  ( F : A --> { B }  <->  ( F  Fn  A  /\  A. y  e.  A  ( F `  y )  =  B ) ) )
2 fnfun 5427 . . . 4  |-  ( F  Fn  A  ->  Fun  F )
3 fndm 5429 . . . . 5  |-  ( F  Fn  A  ->  dom  F  =  A )
4 eqimss2 3282 . . . . 5  |-  ( dom 
F  =  A  ->  A  C_  dom  F )
53, 4syl 14 . . . 4  |-  ( F  Fn  A  ->  A  C_ 
dom  F )
6 funconstss 5765 . . . 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 1397   E.wex 1540    e. wcel 2202   A.wral 2510    C_ wss 3200   {csn 3669   `'ccnv 4724   dom cdm 4725   "cima 4728   Fun wfun 5320    Fn wfn 5321   -->wf 5322   ` cfv 5326
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332  df-fv 5334
This theorem is referenced by:  fconst4m  5873
  Copyright terms: Public domain W3C validator