Theorem setpreimafvex 48668

Description: The class 𝑃 of all preimages of function values is a set. (Contributed by AV, 10-Mar-2024.)

Hypothesis

Ref	Expression
setpreimafvex.p	⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}

Assertion

Ref	Expression
setpreimafvex	⊢ (𝐴 ∈ 𝑉 → 𝑃 ∈ V)

Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧

Allowed substitution hints:   𝑃(𝑥, 𝑧)   𝑉(𝑥, 𝑧)

Proof of Theorem setpreimafvex

Step	Hyp	Ref	Expression
1		setpreimafvex.p	. 2 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
2		abrexexg 7994	. 2 ⊢ (𝐴 ∈ 𝑉 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ∈ V)
3	1, 2	eqeltrid 2868	1 ⊢ (𝐴 ∈ 𝑉 → 𝑃 ∈ V)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454  {csn 4588  ^◡ccnv 5654   “ cima 5658  ‘cfv 6555

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-rep 5235

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-rex 3091  df-v 3456

This theorem is used by:  fundcmpsurbijinjpreimafv  48692