Theorem preimafvelsetpreimafv 48469

Description: The preimage of a function value is an element of the class 𝑃 of all preimages of function values. (Contributed by AV, 10-Mar-2024.)

Hypothesis

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

Assertion

Ref	Expression
preimafvelsetpreimafv	⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃)

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

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

Proof of Theorem preimafvelsetpreimafv

Step	Hyp	Ref	Expression
1		id 23	. . . 4 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ 𝐴)
2		fveq2 6885	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
3	2	sneqd 4596	. . . . . . 7 ⊢ (𝑥 = 𝑋 → {(𝐹‘𝑥)} = {(𝐹‘𝑋)})
4	3	imaeq2d 6052	. . . . . 6 ⊢ (𝑥 = 𝑋 → (◡𝐹 “ {(𝐹‘𝑥)}) = (◡𝐹 “ {(𝐹‘𝑋)}))
5	4	eqeq2d 2772	. . . . 5 ⊢ (𝑥 = 𝑋 → ((◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)})))
6	5	adantl 487	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 = 𝑋) → ((◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)})))
7		eqidd 2762	. . . 4 ⊢ (𝑋 ∈ 𝐴 → (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)}))
8	1, 6, 7	rspcedvd 3579	. . 3 ⊢ (𝑋 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
9	8	3ad2ant3 1153	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
10		fnex 7223	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐹 ∈ V)
11		cnvexg 7936	. . . . 5 ⊢ (𝐹 ∈ V → ◡𝐹 ∈ V)
12		imaexg 7925	. . . . 5 ⊢ (◡𝐹 ∈ V → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ V)
13	10, 11, 12	3syl 19	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ V)
14	13	3adant3 1150	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ V)
15		setpreimafvex.p	. . . 4 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
16	15	elsetpreimafvb 48465	. . 3 ⊢ ((◡𝐹 “ {(𝐹‘𝑋)}) ∈ V → ((◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)})))
17	14, 16	syl 18	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → ((◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)})))
18	9, 17	mpbird 260	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087  Vcvv 3451  {csn 4584  ^◡ccnv 5650   “ cima 5654   Fn wfn 6533  ‘cfv 6538

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546

This theorem is used by:  imasetpreimafvbijlemfo  48486  fundcmpsurbijinjpreimafv  48488