Theorem preimafvsnel 47567

Description: The preimage of a function value at 𝑋 contains 𝑋. (Contributed by AV, 7-Mar-2024.)

Assertion

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

Proof of Theorem preimafvsnel

Step	Hyp	Ref	Expression
1		simpr 484	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴)
2		eqidd 2735	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = (𝐹‘𝑋))
3		fniniseg 7003	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = (𝐹‘𝑋))))
4	3	adantr 480	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = (𝐹‘𝑋))))
5	1, 2, 4	mpbir2and 713	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  {csn 4578  ^◡ccnv 5621   “ cima 5625   Fn wfn 6485  ‘cfv 6490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-fv 6498

This theorem is referenced by:  preimafvn0  47568  uniimaprimaeqfv  47570  fvelsetpreimafv  47575  0nelsetpreimafv  47578