Theorem breldmg 5780

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 5072	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
2	1	spcegv 3599	. . . 4 ⊢ (𝐵 ∈ 𝐷 → (𝐴𝑅𝐵 → ∃𝑥 𝐴𝑅𝑥))
3	2	imp 409	. . 3 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → ∃𝑥 𝐴𝑅𝑥)
4		eldmg 5769	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
5	3, 4	syl5ibr 248	. 2 ⊢ (𝐴 ∈ 𝐶 → ((𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅))
6	5	3impib 1112	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ dom 𝑅)

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083  ∃wex 1780   ∈ wcel 2114   class class class wbr 5068  dom cdm 5557

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-br 5069  df-dm 5567

This theorem is referenced by:  breldmd  5783  brelrng  5813  releldm  5816  sossfld  6045  brtpos  7903  wfrlem17  7973  tfrlem9a  8024  perpln1  26498  lmdvg  31198  esumcvgsum  31349  climeldmeq  41953  climfv  41979  climxlim2  42134  sge0isum  42716  smflimsuplem6  43106  eubrdm  43278  funressneu  43289  tz6.12-afv  43379  rlimdmafv  43383  tz6.12-afv2  43446  rlimdmafv2  43464