Theorem breldmg 5887

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 5106	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
2	1	spcegv 3551	. . . 4 ⊢ (𝐵 ∈ 𝐷 → (𝐴𝑅𝐵 → ∃𝑥 𝐴𝑅𝑥))
3	2	imp 412	. . 3 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → ∃𝑥 𝐴𝑅𝑥)
4		eldmg 5876	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
5	3, 4	imbitrrid 249	. 2 ⊢ (𝐴 ∈ 𝐶 → ((𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅))
6	5	3impib 1134	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∃wex 1812   ∈ wcel 2145   class class class wbr 5102  dom cdm 5647

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-dm 5657

This theorem is used by:  breldmd  5890  brelrng  5919  releldm  5922  sossfld  6173  brtpos  8230  fprresex  8306  tfrlem9a  8372  perpln1  29118  lmdvg  34518  esumcvgsum  34653  climeldmeq  46597  climfv  46623  climxlim2  46778  sge0isum  47359  smflimsuplem6  47757  eubrdm  48028  funressneu  48039  tz6.12-afv  48165  rlimdmafv  48169  tz6.12-afv2  48232  rlimdmafv2  48250