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

Theorem opi1 2790
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 2756 . . 3 |- {A} e. V
21pri1 2454 . 2 |- {A} e. {{A}, {A, B}}
3 df-op 2420 . 2 |- <.A, B>. = {{A}, {A, B}}
42, 3eleqtrr 1550 1 |- {A} e. <.A, B>.
Colors of variables: wff set class
Syntax hints:   e. wcel 960  {csn 2413  {cpr 2414  <.cop 2415
This theorem is referenced by:  opth1 2792  opnz 2801  0nelxp 3246
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-11 969  ax-12 970  ax-13 971  ax-14 972  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  ax-sep 2708  ax-pow 2748
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420
Copyright terms: Public domain