Theorem preimafvsnel 47312

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 7061	. . 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 1539   ∈ wcel 2107  {csn 4608  ^◡ccnv 5666   “ cima 5670   Fn wfn 6537  ‘cfv 6542

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-12 2176  ax-ext 2706  ax-sep 5278  ax-nul 5288  ax-pr 5414

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3421  df-v 3466  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-nul 4316  df-if 4508  df-sn 4609  df-pr 4611  df-op 4615  df-uni 4890  df-br 5126  df-opab 5188  df-id 5560  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-iota 6495  df-fun 6544  df-fn 6545  df-fv 6550

This theorem is referenced by:  preimafvn0  47313  uniimaprimaeqfv  47315  fvelsetpreimafv  47320  0nelsetpreimafv  47323