Theorem breldmd 5876

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 5873	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅)
5	1, 2, 3, 4	syl3anc 1373	1 ⊢ (𝜑 → 𝐴 ∈ dom 𝑅)

Syntax hints:   → wi 4   ∈ wcel 2109   class class class wbr 5107  dom cdm 5638

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-dm 5648

This theorem is referenced by:  fvelimad  6928  climresdm  45848  xlimliminflimsup  45860