Theorem elrnressn 38957

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 38955	. 2 ⊢ (𝐵 ∈ 𝑊 → (𝐵 ∈ ran (𝑅 ↾ {𝐴}) ↔ ∃𝑥 ∈ {𝐴}𝑥𝑅𝐵))
2		breq1 5112	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝐵 ↔ 𝐴𝑅𝐵))
3	2	rexsng 4642	. 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝑥𝑅𝐵 ↔ 𝐴𝑅𝐵))
4	1, 3	sylan9bbr 519	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ ran (𝑅 ↾ {𝐴}) ↔ 𝐴𝑅𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∈ wcel 2143  ∃wrex 3089  {csn 4589   class class class wbr 5109  ran crn 5662   ↾ cres 5663

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673

This theorem is used by:  refressn  39210