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

Theorem elvvuni 5179
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 5177 . 2 (𝐴 ∈ (V × V) ↔ ∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2 vex 3203 . . . . . 6 𝑥 ∈ V
3 vex 3203 . . . . . 6 𝑦 ∈ V
42, 3uniop 4977 . . . . 5 𝑥, 𝑦⟩ = {𝑥, 𝑦}
52, 3opi2 4938 . . . . 5 {𝑥, 𝑦} ∈ ⟨𝑥, 𝑦
64, 5eqeltri 2697 . . . 4 𝑥, 𝑦⟩ ∈ ⟨𝑥, 𝑦
7 unieq 4444 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝑥, 𝑦⟩)
8 id 22 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴 = ⟨𝑥, 𝑦⟩)
97, 8eleq12d 2695 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → ( 𝐴𝐴𝑥, 𝑦⟩ ∈ ⟨𝑥, 𝑦⟩))
106, 9mpbiri 248 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴𝐴)
1110exlimivv 1860 . 2 (∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → 𝐴𝐴)
121, 11sylbi 207 1 (𝐴 ∈ (V × V) → 𝐴𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1483  wex 1704  wcel 1990  Vcvv 3200  {cpr 4179  cop 4183   cuni 4436   × cxp 5112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-opab 4713  df-xp 5120
This theorem is referenced by:  unielxp  7204
  Copyright terms: Public domain W3C validator