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

Theorem elvvuni 3224
Description: An ordered pair contains its union.
Assertion
Ref Expression
elvvuni |- (A e. (V X. V) -> U.A e. A)

Proof of Theorem elvvuni
StepHypRef Expression
1 elvv 3223 . 2 |- (A e. (V X. V) <-> E.xE.y A = <.x, y>.)
2 uniop 2803 . . . . 5 |- U.<.x, y>. = {x, y}
3 opi2 2780 . . . . 5 |- {x, y} e. <.x, y>.
42, 3eqeltr 1541 . . . 4 |- U.<.x, y>. e. <.x, y>.
5 unieq 2505 . . . . 5 |- (A = <.x, y>. -> U.A = U.<.x, y>.)
6 id 59 . . . . 5 |- (A = <.x, y>. -> A = <.x, y>.)
75, 6eleq12d 1539 . . . 4 |- (A = <.x, y>. -> (U.A e. A <-> U.<.x, y>. e. <.x, y>.))
84, 7mpbiri 194 . . 3 |- (A = <.x, y>. -> U.A e. A)
9819.23aivv 1294 . 2 |- (E.xE.y A = <.x, y>. -> U.A e. A)
101, 9sylbi 199 1 |- (A e. (V X. V) -> U.A e. A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 954   e. wcel 956  E.wex 978  Vcvv 1807  {cpr 2406  <.cop 2407  U.cuni 2498   X. cxp 3163
This theorem is referenced by:  unielxp 4097
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-uni 2499  df-opab 2662  df-xp 3179
Copyright terms: Public domain