Theorem preimafvelsetpreimafv 48612

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 6896	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
3	2	sneqd 4596	. . . . . . 7 ⊢ (𝑥 = 𝑋 → {(𝐹‘𝑥)} = {(𝐹‘𝑋)})
4	3	imaeq2d 6058	. . . . . 6 ⊢ (𝑥 = 𝑋 → (◡𝐹 “ {(𝐹‘𝑥)}) = (◡𝐹 “ {(𝐹‘𝑋)}))
5	4	eqeq2d 2774	. . . . 5 ⊢ (𝑥 = 𝑋 → ((◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)})))
6	5	adantl 487	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 = 𝑋) → ((◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)})))
7		eqidd 2764	. . . 4 ⊢ (𝑋 ∈ 𝐴 → (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)}))
8	1, 6, 7	rspcedvd 3582	. . 3 ⊢ (𝑋 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
9	8	3ad2ant3 1153	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
10		fnex 7233	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐹 ∈ V)
11		cnvexg 7946	. . . . 5 ⊢ (𝐹 ∈ V → ◡𝐹 ∈ V)
12		imaexg 7935	. . . . 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 48608	. . 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 1569   ∈ wcel 2146  {cab 2741  ∃wrex 3090  Vcvv 3454  {csn 4588  ^◡ccnv 5654   “ cima 5658   Fn wfn 6542  ‘cfv 6547

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555

This theorem is used by:  imasetpreimafvbijlemfo  48629  fundcmpsurbijinjpreimafv  48631