Theorem brelrng 4917

Description: The second argument of a binary relation belongs to its range. (Contributed by NM, 29-Jun-2008.)

Assertion

Ref	Expression
brelrng	⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶)

Proof of Theorem brelrng

Step	Hyp	Ref	Expression
1		brcnvg 4866	. . . . 5 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵))
2	1	ancoms 268	. . . 4 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵))
3	2	biimp3ar 1359	. . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵◡𝐶𝐴)
4		breldmg 4892	. . . 4 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶)
5	4	3com12 1210	. . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶)
6	3, 5	syld3an3 1295	. 2 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ dom ◡𝐶)
7		df-rn 4693	. 2 ⊢ ran 𝐶 = dom ◡𝐶
8	6, 7	eleqtrrdi 2300	1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶)

Syntax hints:   → wi 4   ↔ wb 105   ∧ w3a 981   ∈ wcel 2177   class class class wbr 4050  ^◡ccnv 4681  dom cdm 4682  ran crn 4683

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4169  ax-pow 4225  ax-pr 4260

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-pw 3622  df-sn 3643  df-pr 3644  df-op 3646  df-br 4051  df-opab 4113  df-cnv 4690  df-dm 4692  df-rn 4693

This theorem is referenced by:  opelrng  4918  brelrn  4919  relelrn  4922  fvssunirng  5603  shftfvalg  11199  ovshftex  11200  shftfval  11202