Theorem breldmd 5937

Description: Membership of first of a binary relation in a domain. (Contributed by Glauco Siliprandi, 23-Apr-2023.)

Hypotheses

Ref	Expression
breldmd.1	⊢ (𝜑 → 𝐴 ∈ 𝐶)
breldmd.2	⊢ (𝜑 → 𝐵 ∈ 𝐷)
breldmd.3	⊢ (𝜑 → 𝐴𝑅𝐵)

Assertion

Ref	Expression
breldmd	⊢ (𝜑 → 𝐴 ∈ dom 𝑅)

Proof of Theorem breldmd

Step	Hyp	Ref	Expression
1		breldmd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐶)
2		breldmd.2	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝐷)
3		breldmd.3	. 2 ⊢ (𝜑 → 𝐴𝑅𝐵)
4		breldmg 5934	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅)
5	1, 2, 3, 4	syl3anc 1371	1 ⊢ (𝜑 → 𝐴 ∈ dom 𝑅)

Syntax hints:   → wi 4   ∈ wcel 2108   class class class wbr 5166  dom cdm 5700

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-dm 5710

This theorem is referenced by:  fvelimad  6989  climresdm  45771  xlimliminflimsup  45783