Theorem opeldm 5894

Description: Membership of first of an ordered pair in a domain. (Contributed by NM, 30-Jul-1995.)

Hypotheses

Ref	Expression
opeldm.1	⊢ 𝐴 ∈ V
opeldm.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
opeldm	⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶)

Proof of Theorem opeldm

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeldm.2	. . 3 ⊢ 𝐵 ∈ V
2		opeq2 4844	. . . 4 ⊢ (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
3	2	eleq1d 2849	. . 3 ⊢ (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
4	1, 3	spcev 3564	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶)
5		opeldm.1	. . 3 ⊢ 𝐴 ∈ V
6	5	eldm2 5888	. 2 ⊢ (𝐴 ∈ dom 𝐶 ↔ ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶)
7	4, 6	sylibr 237	1 ⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1569  ∃wex 1811   ∈ wcel 2146  Vcvv 3454  ⟨cop 4838  dom cdm 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-dm 5665

This theorem is used by:  breldm  5895  elreldm  5922  relssres  6017  iss  6033  dfrn7  6072  imadmrnOLD  6074  dfco2a  6254  relssdmrn  6278  funssres  6593  funun  6595  frxp2  8174  frxp3  8181  frrlem8  8325  frrlem10  8327  tz7.48-1  8467  iiner  8824  r0weon  10104  axdc3lem2  10542  uzrdgfni  14114  imasaddfnlem  17715  imasvscafn  17724  cicsym  17994  gsum2d  20201  noseqrdgfn  28707  cffldtocusgr  30043  dfcnv2  33326  gsumfs2d  33678  bnj1379  35516  iss2  39419  rfovcnvf1od  45147