Theorem opelrn 5931

Description: Membership of second member of an ordered pair in a range. (Contributed by NM, 23-Feb-1997.)

Hypotheses

Ref	Expression
brelrn.1	⊢ 𝐴 ∈ V
brelrn.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
opelrn	⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐵 ∈ ran 𝐶)

Proof of Theorem opelrn

Step	Hyp	Ref	Expression
1		df-br 5108	. 2 ⊢ (𝐴𝐶𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶)
2		brelrn.1	. . 3 ⊢ 𝐴 ∈ V
3		brelrn.2	. . 3 ⊢ 𝐵 ∈ V
4	2, 3	brelrn 5930	. 2 ⊢ (𝐴𝐶𝐵 → 𝐵 ∈ ran 𝐶)
5	1, 4	sylbir 238	1 ⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐵 ∈ ran 𝐶)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Vcvv 3453  ⟨cop 4593   class class class wbr 5107  ran crn 5660

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-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-cnv 5667  df-dm 5669  df-rn 5670

This theorem is used by:  dfres3  5981  relssdmrn  6270  zfrep6OLD  7956  2ndrn  8042  disjen  9136  r0weon  10019  gsum2dlem1  20103  gsum2dlem2  20104  iss2  39100  rfovcnvf1od  44852