MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elvvuni Structured version   Visualization version   GIF version

Theorem elvvuni 5740
Description: An ordered pair contains its union. (Contributed by NM, 16-Sep-2006.)
Assertion
Ref Expression
elvvuni (𝐴 ∈ (V × V) → 𝐴𝐴)

Proof of Theorem elvvuni
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elvv 5738 . 2 (𝐴 ∈ (V × V) ↔ ∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2 vex 3461 . . . . . 6 𝑥 ∈ V
3 vex 3461 . . . . . 6 𝑦 ∈ V
42, 3uniop 5500 . . . . 5 𝑥, 𝑦⟩ = {𝑥, 𝑦}
52, 3opi2 5453 . . . . 5 {𝑥, 𝑦} ∈ ⟨𝑥, 𝑦
64, 5eqeltri 2861 . . . 4 𝑥, 𝑦⟩ ∈ ⟨𝑥, 𝑦
7 unieq 4885 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝑥, 𝑦⟩)
8 id 23 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴 = ⟨𝑥, 𝑦⟩)
97, 8eleq12d 2859 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → ( 𝐴𝐴𝑥, 𝑦⟩ ∈ ⟨𝑥, 𝑦⟩))
106, 9mpbiri 261 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴𝐴)
1110exlimivv 1965 . 2 (∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴𝐴)
121, 11sylbi 220 1 (𝐴 ∈ (V × V) → 𝐴𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wex 1812  wcel 2146  Vcvv 3457  {cpr 4593  cop 4597   cuni 4874   × cxp 5661
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-opab 5176  df-xp 5669
This theorem is used by:  unielxp  8026
  Copyright terms: Public domain W3C validator