HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem opeldm 3320
Description: Membership of first of an ordered pair in a domain.
Hypothesis
Ref Expression
opeldm.1 |- A e. V
Assertion
Ref Expression
opeldm |- (<.A, B>. e. C -> A e. dom C)

Proof of Theorem opeldm
StepHypRef Expression
1 opeq2 2492 . . . . 5 |- (y = B -> <.A, y>. = <.A, B>.)
21eleq1d 1543 . . . 4 |- (y = B -> (<.A, y>. e. C <-> <.A, B>. e. C))
32cla4egv 1866 . . 3 |- (B e. V -> (<.A, B>. e. C -> E.y<.A, y>. e. C))
4 opeldm.1 . . . 4 |- A e. V
54eldm2 3314 . . 3 |- (A e. dom C <-> E.y<.A, y>. e. C)
63, 5syl6ibr 213 . 2 |- (B e. V -> (<.A, B>. e. C -> A e. dom C))
7 opprc2 2503 . . . 4 |- (-. B e. V -> <.A, B>. = <.A, A>.)
87eleq1d 1543 . . 3 |- (-. B e. V -> (<.A, B>. e. C <-> <.A, A>. e. C))
9 opeq2 2492 . . . . . 6 |- (y = A -> <.A, y>. = <.A, A>.)
109eleq1d 1543 . . . . 5 |- (y = A -> (<.A, y>. e. C <-> <.A, A>. e. C))
114, 10cla4ev 1872 . . . 4 |- (<.A, A>. e. C -> E.y<.A, y>. e. C)
1211, 5sylibr 200 . . 3 |- (<.A, A>. e. C -> A e. dom C)
138, 12syl6bi 214 . 2 |- (-. B e. V -> (<.A, B>. e. C -> A e. dom C))
146, 13pm2.61i 126 1 |- (<.A, B>. e. C -> A e. dom C)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   = wceq 958   e. wcel 960  E.wex 982  Vcvv 1814  <.cop 2415  dom cdm 3176
This theorem is referenced by:  breldm 3321  elreldm 3344  relssres 3398  imadmrn 3420  funssres 3558  funun 3560  fnrnfv 3765  eqfnfv 3803  tz7.48-1 3962  ecopoprdm 4315
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-nul 2284  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-dm 3194
Copyright terms: Public domain