Theorem breldmg 5876

Description: Membership of first of a binary relation in a domain. (Contributed by NM, 21-Mar-2007.)

Assertion

Ref	Expression
breldmg	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅)

Proof of Theorem breldmg

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 5114	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
2	1	spcegv 3566	. . . 4 ⊢ (𝐵 ∈ 𝐷 → (𝐴𝑅𝐵 → ∃𝑥 𝐴𝑅𝑥))
3	2	imp 406	. . 3 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → ∃𝑥 𝐴𝑅𝑥)
4		eldmg 5865	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
5	3, 4	imbitrrid 246	. 2 ⊢ (𝐴 ∈ 𝐶 → ((𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅))
6	5	3impib 1116	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086  ∃wex 1779   ∈ wcel 2109   class class class wbr 5110  dom cdm 5641

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 2702

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 2709  df-cleq 2722  df-clel 2804  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-dm 5651

This theorem is referenced by:  breldmd  5879  brelrng  5908  releldm  5911  sossfld  6162  brtpos  8217  fprresex  8292  tfrlem9a  8357  perpln1  28644  lmdvg  33950  esumcvgsum  34085  climeldmeq  45670  climfv  45696  climxlim2  45851  sge0isum  46432  smflimsuplem6  46830  eubrdm  47041  funressneu  47052  tz6.12-afv  47178  rlimdmafv  47182  tz6.12-afv2  47245  rlimdmafv2  47263