Theorem elmptima 45294

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

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1541   ∈ wcel 2111  ∃wrex 3056   ∩ cin 3901   ↦ cmpt 5172  ran crn 5617   “ cima 5619

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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

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 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-br 5092  df-opab 5154  df-mpt 5173  df-xp 5622  df-rel 5623  df-cnv 5624  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629

This theorem is referenced by:  liminfvalxr  45820