Theorem fconstfvm 5933

Description: A constant function expressed in terms of its functionality, domain, and value. See also fconst2 5932. (Contributed by Jim Kingdon, 8-Jan-2019.)

Assertion

Ref	Expression
fconstfvm	|- ( E. y y e. A -> ( F : A --> { B } <-> ( F Fn A /\ A. x e. A ( F ` x ) = B ) ) )

Distinct variable groups:   x, A   x, B   x, F   y, A

Allowed substitution hints:   B( y)   F( y)

Proof of Theorem fconstfvm

Dummy variables w z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffn 5533	. . 3 |- ( F : A --> { B } -> F Fn A )
2		fvconst 5903	. . . 4 |- ( ( F : A --> { B } /\ x e. A ) -> ( F ` x ) = B )
3	2	ralrimiva 2623	. . 3 |- ( F : A --> { B } -> A. x e. A ( F ` x ) = B )
4	1, 3	jca 306	. 2 |- ( F : A --> { B } -> ( F Fn A /\ A. x e. A ( F ` x ) = B ) )
5		fvelrnb 5750	. . . . . . . . 9 |- ( F Fn A -> ( w e. ran F <-> E. z e. A ( F ` z ) = w ) )
6		fveq2 5695	. . . . . . . . . . . . . 14 |- ( x = z -> ( F ` x ) = ( F ` z ) )
7	6	eqeq1d 2247	. . . . . . . . . . . . 13 |- ( x = z -> ( ( F ` x ) = B <-> ( F ` z ) = B ) )
8	7	rspccva 2928	. . . . . . . . . . . 12 |- ( ( A. x e. A ( F ` x ) = B /\ z e. A ) -> ( F ` z ) = B )
9	8	eqeq1d 2247	. . . . . . . . . . 11 |- ( ( A. x e. A ( F ` x ) = B /\ z e. A ) -> ( ( F ` z ) = w <-> B = w ) )
10	9	rexbidva 2547	. . . . . . . . . 10 |- ( A. x e. A ( F ` x ) = B -> ( E. z e. A ( F ` z ) = w <-> E. z e. A B = w ) )
11		r19.9rmv 3619	. . . . . . . . . . 11 |- ( E. y y e. A -> ( B = w <-> E. z e. A B = w ) )
12	11	bicomd 141	. . . . . . . . . 10 |- ( E. y y e. A -> ( E. z e. A B = w <-> B = w ) )
13	10, 12	sylan9bbr 467	. . . . . . . . 9 |- ( ( E. y y e. A /\ A. x e. A ( F ` x ) = B ) -> ( E. z e. A ( F ` z ) = w <-> B = w ) )
14	5, 13	sylan9bbr 467	. . . . . . . 8 |- ( ( ( E. y y e. A /\ A. x e. A ( F ` x ) = B ) /\ F Fn A ) -> ( w e. ran F <-> B = w ) )
15		velsn 3726	. . . . . . . . 9 |- ( w e. { B } <-> w = B )
16		eqcom 2240	. . . . . . . . 9 |- ( w = B <-> B = w )
17	15, 16	bitr2i 185	. . . . . . . 8 |- ( B = w <-> w e. { B } )
18	14, 17	bitrdi 196	. . . . . . 7 |- ( ( ( E. y y e. A /\ A. x e. A ( F ` x ) = B ) /\ F Fn A ) -> ( w e. ran F <-> w e. { B } ) )
19	18	eqrdv 2236	. . . . . 6 |- ( ( ( E. y y e. A /\ A. x e. A ( F ` x ) = B ) /\ F Fn A ) -> ran F = { B } )
20	19	an32s 574	. . . . 5 |- ( ( ( E. y y e. A /\ F Fn A ) /\ A. x e. A ( F ` x ) = B ) -> ran F = { B } )
21	20	exp31 364	. . . 4 |- ( E. y y e. A -> ( F Fn A -> ( A. x e. A ( F ` x ) = B -> ran F = { B } ) ) )
22	21	imdistand 451	. . 3 |- ( E. y y e. A -> ( ( F Fn A /\ A. x e. A ( F ` x ) = B ) -> ( F Fn A /\ ran F = { B } ) ) )
23		df-fo 5383	. . . 4 |- ( F : A -onto-> { B } <-> ( F Fn A /\ ran F = { B } ) )
24		fof 5615	. . . 4 |- ( F : A -onto-> { B } -> F : A --> { B } )
25	23, 24	sylbir 135	. . 3 |- ( ( F Fn A /\ ran F = { B } ) -> F : A --> { B } )
26	22, 25	syl6 33	. 2 |- ( E. y y e. A -> ( ( F Fn A /\ A. x e. A ( F ` x ) = B ) -> F : A --> { B } ) )
27	4, 26	impbid2 143	1 |- ( E. y y e. A -> ( F : A --> { B } <-> ( F Fn A /\ A. x e. A ( F ` x ) = B ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   E.wex 1545   e. wcel 2209   A.wral 2528   E.wrex 2529   {csn 3709   ran crn 4775   Fn wfn 5372   -->wf 5373   -onto->wfo 5375   ` cfv 5377

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-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385

This theorem is used by:  fconst3m  5934