Theorem elmptima 45498

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 6031	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) = ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵)
2	1	a1i 11	. . 3 ⊢ (𝐶 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) = ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵))
3	2	eleq2d 2822	. 2 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) ↔ 𝐶 ∈ ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵)))
4		eqid 2736	. . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵) = (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵)
5	4	elrnmpt 5907	. 2 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran (𝑥 ∈ (𝐴 ∩ 𝐷) ↦ 𝐵) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐷)𝐶 = 𝐵))
6	3, 5	bitrd 279	1 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐷) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐷)𝐶 = 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1541   ∈ wcel 2113  ∃wrex 3060   ∩ cin 3900   ↦ cmpt 5179  ran crn 5625   “ cima 5627

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-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-mpt 5180  df-xp 5630  df-rel 5631  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637

This theorem is referenced by:  liminfvalxr  46023