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

Theorem elvvuni 5628
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 5626 . 2 (𝐴 ∈ (V × V) ↔ ∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2 vex 3497 . . . . . 6 𝑥 ∈ V
3 vex 3497 . . . . . 6 𝑦 ∈ V
42, 3uniop 5405 . . . . 5 𝑥, 𝑦⟩ = {𝑥, 𝑦}
52, 3opi2 5361 . . . . 5 {𝑥, 𝑦} ∈ ⟨𝑥, 𝑦
64, 5eqeltri 2909 . . . 4 𝑥, 𝑦⟩ ∈ ⟨𝑥, 𝑦
7 unieq 4849 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝑥, 𝑦⟩)
8 id 22 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴 = ⟨𝑥, 𝑦⟩)
97, 8eleq12d 2907 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → ( 𝐴𝐴𝑥, 𝑦⟩ ∈ ⟨𝑥, 𝑦⟩))
106, 9mpbiri 260 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴𝐴)
1110exlimivv 1933 . 2 (∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴𝐴)
121, 11sylbi 219 1 (𝐴 ∈ (V × V) → 𝐴𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wex 1780  wcel 2114  Vcvv 3494  {cpr 4569  cop 4573   cuni 4838   × cxp 5553
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-opab 5129  df-xp 5561
This theorem is referenced by:  unielxp  7727
  Copyright terms: Public domain W3C validator