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

Theorem opi1 2774
Description: One of the two elements in an ordered pair.
Assertion
Ref Expression
opi1 |- {A} e. <.A, B>.

Proof of Theorem opi1
StepHypRef Expression
1 snex 2740 . . 3 |- {A} e. V
21pri1 2441 . 2 |- {A} e. {{A}, {A, B}}
3 df-op 2406 . 2 |- <.A, B>. = {{A}, {A, B}}
42, 3eleqtrr 1539 1 |- {A} e. <.A, B>.
Colors of variables: wff set class
Syntax hints:   e. wcel 955  {csn 2399  {cpr 2400  <.cop 2401
This theorem is referenced by:  opth1 2776  opnz 2785  opth1gOLD 2788  0nelxp 3230
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-op 2406
Copyright terms: Public domain