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

Theorem opeldm 3314
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 2488 . . . . 5 |- (y = B -> <.A, y>. = <.A, B>.)
21eleq1d 1540 . . . 4 |- (y = B -> (<.A, y>. e. C <-> <.A, B>. e. C))
32cla4egv 1863 . . 3 |- (B e. V -> (<.A, B>. e. C -> E.y<.A, y>. e. C))
4 opeldm.1 . . . 4 |- A e. V
54eldm2 3308 . . 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 2499 . . . 4 |- (-. B e. V -> <.A, B>. = <.A, A>.)
87eleq1d 1540 . . 3 |- (-. B e. V -> (<.A, B>. e. C <-> <.A, A>. e. C))
9 opeq2 2488 . . . . . 6 |- (y = A -> <.A, y>. = <.A, A>.)
109eleq1d 1540 . . . . 5 |- (y = A -> (<.A, y>. e. C <-> <.A, A>. e. C))
114, 10cla4ev 1869 . . . 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 956   e. wcel 958  E.wex 980  Vcvv 1811  <.cop 2411  dom cdm 3170
This theorem is referenced by:  breldm 3315  elreldm 3338  relssres 3392  imadmrn 3414  funssres 3552  funun 3554  fnrnfv 3759  eqfnfv 3797  tz7.48-1 3956  ecopoprdm 4309
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-nul 2281  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-dm 3188
Copyright terms: Public domain