Theorem brelrng 4993

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 4941	. . . . 5 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵))
2	1	ancoms 268	. . . 4 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵))
3	2	biimp3ar 1383	. . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵◡𝐶𝐴)
4		breldmg 4967	. . . 4 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶)
5	4	3com12 1234	. . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶)
6	3, 5	syld3an3 1319	. 2 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ dom ◡𝐶)
7		df-rn 4765	. 2 ⊢ ran 𝐶 = dom ◡𝐶
8	6, 7	eleqtrrdi 2328	1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶)

Syntax hints:   → wi 4   ↔ wb 105   ∧ w3a 1005   ∈ wcel 2205   class class class wbr 4114  ^◡ccnv 4753  dom cdm 4754  ran crn 4755

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-cnv 4762  df-dm 4764  df-rn 4765

This theorem is referenced by:  opelrng  4994  brelrn  4995  relelrn  4998  fvssunirng  5690  shftfvalg  11528  ovshftex  11529  shftfval  11531