Theorem fabexd

Description: Existence of a set of functions. In contrast to fabex or fabexg , the condition in the class abstraction does not contain the function explicitly, but the function can be derived from it. Therefore, this theorem is also applicable for more special functions like one-to-one, onto or one-to-one onto functions. (Contributed by AV, 20-May-2025)

	Ref	Expression
Hypotheses	fabexd.f	|- ( ( ph /\ ps ) -> f : X --> Y )
	fabexd.x	|- ( ph -> X e. V )
	fabexd.y	|- ( ph -> Y e. W )
Assertion	fabexd	|- ( ph -> { f | ps } e. _V )

Proof

Step	Hyp	Ref	Expression
1		fabexd.f	|- ( ( ph /\ ps ) -> f : X --> Y )
2		fabexd.x	|- ( ph -> X e. V )
3		fabexd.y	|- ( ph -> Y e. W )
4	2 3	xpexd	|- ( ph -> ( X X. Y ) e. _V )
5	4	pwexd	|- ( ph -> ~P ( X X. Y ) e. _V )
6		fssxp	|- ( f : X --> Y -> f C_ ( X X. Y ) )
7		velpw	|- ( f e. ~P ( X X. Y ) <-> f C_ ( X X. Y ) )
8	6 7	sylibr	|- ( f : X --> Y -> f e. ~P ( X X. Y ) )
9	1 8	syl	|- ( ( ph /\ ps ) -> f e. ~P ( X X. Y ) )
10	9	ex	|- ( ph -> ( ps -> f e. ~P ( X X. Y ) ) )
11	10	abssdv	|- ( ph -> { f | ps } C_ ~P ( X X. Y ) )
12	5 11	ssexd	|- ( ph -> { f | ps } e. _V )