Theorem brelrng 4583

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 4534	. . . . 5 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵))
2	1	ancoms 264	. . . 4 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵))
3	2	biimp3ar 1277	. . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵◡𝐶𝐴)
4		breldmg 4559	. . . 4 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶)
5	4	3com12 1142	. . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶)
6	3, 5	syld3an3 1214	. 2 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ dom ◡𝐶)
7		df-rn 4374	. 2 ⊢ ran 𝐶 = dom ◡𝐶
8	6, 7	syl6eleqr 2172	1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶)

Syntax hints:   → wi 4   ↔ wb 103   ∧ w3a 919   ∈ wcel 1433   class class class wbr 3785  ^◡ccnv 4362  dom cdm 4363  ran crn 4364

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-cnv 4371  df-dm 4373  df-rn 4374

This theorem is referenced by:  opelrng  4584  brelrn  4585  relelrn  4588  fvssunirng  5210  shftfvalg  9706  ovshftex  9707  shftfval  9709