Theorem elrnressn 39013

Description: Element of the range of a restriction to a singleton. (Contributed by Peter Mazsa, 12-Jun-2024.)

Assertion

Ref	Expression
elrnressn	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ ran (𝑅 ↾ {𝐴}) ↔ 𝐴𝑅𝐵))

Proof of Theorem elrnressn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elrnres 39011	. 2 ⊢ (𝐵 ∈ 𝑊 → (𝐵 ∈ ran (𝑅 ↾ {𝐴}) ↔ ∃𝑥 ∈ {𝐴}𝑥𝑅𝐵))
2		breq1 5110	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝐵 ↔ 𝐴𝑅𝐵))
3	2	rexsng 4640	. 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝑥𝑅𝐵 ↔ 𝐴𝑅𝐵))
4	1, 3	sylan9bbr 520	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ ran (𝑅 ↾ {𝐴}) ↔ 𝐴𝑅𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  ∃wrex 3088  {csn 4587   class class class wbr 5107  ran crn 5660   ↾ cres 5661

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671

This theorem is used by:  refressn  39266