MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opeldm Structured version   Visualization version   GIF version

Theorem opeldm 5901
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.
StepHypRef Expression
1 opeldm.2 . . 3 𝐵 ∈ V
2 opeq2 4846 . . . 4 (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
32eleq1d 2849 . . 3 (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
41, 3spcev 3564 . 2 (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶)
5 opeldm.1 . . 3 𝐴 ∈ V
65eldm2 5895 . 2 (𝐴 ∈ dom 𝐶 ↔ ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶)
74, 6sylibr 237 1 (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840  dom cdm 5658
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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 2102  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 4841  df-br 5109  df-dm 5668
This theorem is used by:  breldm  5902  elreldm  5929  relssres  6029  iss  6045  dfrn7  6084  imadmrnOLD  6086  dfco2a  6266  relssdmrn  6295  funssres  6612  funun  6614  frxp2  8198  frxp3  8205  frrlem8  8349  frrlem10  8351  tz7.48-1  8491  iiner  8848  r0weon  10130  axdc3lem2  10568  uzrdgfni  14141  imasaddfnlem  17750  imasvscafn  17759  cicsym  18029  gsum2d  20237  noseqrdgfn  28749  cffldtocusgr  30085  dfcnv2  33366  gsumfs2d  33721  bnj1379  35571  iss2  39542  rfovcnvf1od  45326
  Copyright terms: Public domain W3C validator