Theorem fnbr 6486

Description: The first argument of binary relation on a function belongs to the function's domain. (Contributed by NM, 7-May-2004.)

Assertion

Ref	Expression
fnbr	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵𝐹𝐶) → 𝐵 ∈ 𝐴)

Proof of Theorem fnbr

Step	Hyp	Ref	Expression
1		fnrel 6480	. . 3 ⊢ (𝐹 Fn 𝐴 → Rel 𝐹)
2		releldm 5813	. . 3 ⊢ ((Rel 𝐹 ∧ 𝐵𝐹𝐶) → 𝐵 ∈ dom 𝐹)
3	1, 2	sylan 583	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵𝐹𝐶) → 𝐵 ∈ dom 𝐹)
4		fndm 6481	. . . 4 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
5	4	eleq2d 2823	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ dom 𝐹 ↔ 𝐵 ∈ 𝐴))
6	5	biimpa 480	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ dom 𝐹) → 𝐵 ∈ 𝐴)
7	3, 6	syldan 594	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵𝐹𝐶) → 𝐵 ∈ 𝐴)

Syntax hints:   → wi 4   ∧ wa 399   ∈ wcel 2110   class class class wbr 5053  dom cdm 5551  Rel wrel 5556   Fn wfn 6375

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pr 5322

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-sb 2071  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-sn 4542  df-pr 4544  df-op 4548  df-br 5054  df-opab 5116  df-xp 5557  df-rel 5558  df-dm 5561  df-fun 6382  df-fn 6383

This theorem is referenced by:  fnop  6487  dffn5  6771  feqmptdf  6782  dffo4  6922  dffo5  6923  tfrlem5  8116  occllem  29384  chscllem2  29719  brcoffn  41317  fvelima2  42478  dfafn5a  44324