Theorem elmptima 44261

Description: The image of a function in maps-to notation. (Contributed by Glauco Siliprandi, 2-Jan-2022.)

Assertion

Ref	Expression
elmptima	⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐷)𝐶 = 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)

Proof of Theorem elmptima

Step	Hyp	Ref	Expression
1		mptima 6071	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) = ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵)
2	1	a1i 11	. . 3 ⊢ (𝐶 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) = ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵))
3	2	eleq2d 2819	. 2 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) ↔ 𝐶 ∈ ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵)))
4		eqid 2732	. . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵) = (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵)
5	4	elrnmpt 5955	. 2 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐷)𝐶 = 𝐵))
6	3, 5	bitrd 278	1 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐷)𝐶 = 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1541   ∈ wcel 2106  ∃wrex 3070   ∩ cin 3947   ↦ cmpt 5231  ran crn 5677   “ cima 5679

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-mpt 5232  df-xp 5682  df-rel 5683  df-cnv 5684  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689

This theorem is referenced by:  liminfvalxr  44798