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

Theorem euuni 3807
Description: If ph is true for exactly one x, then U.{x | ph} is a way to express "the unique element such that ph is true." Some books use a special symbol such as iota to denote "the unique element such that."
Assertion
Ref Expression
euuni |- (E!xph -> (ph <-> U.{x | ph} = x))

Proof of Theorem euuni
StepHypRef Expression
1 euabex 3514 . . . 4 |- (E!xph -> {x | ph} e. _V)
2 uniexg 3795 . . . 4 |- ({x | ph} e. _V -> U.{x | ph} e. _V)
31, 2syl 12 . . 3 |- (E!xph -> U.{x | ph} e. _V)
4 eueq 2427 . . . 4 |- (U.{x | ph} e. _V <-> E!y y = U.{x | ph})
5 eqcom 1886 . . . . 5 |- (y = U.{x | ph} <-> U.{x | ph} = y)
65eubii 1780 . . . 4 |- (E!y y = U.{x | ph} <-> E!yU.{x | ph} = y)
7 hbab1 1874 . . . . . . 7 |- (z e. {x | ph} -> A.x z e. {x | ph})
87hbuni 3183 . . . . . 6 |- (z e. U.{x | ph} -> A.x z e. U.{x | ph})
9 ax-17 1317 . . . . . 6 |- (z e. y -> A.x z e. y)
108, 9hbeq 1995 . . . . 5 |- (U.{x | ph} = y -> A.xU.{x | ph} = y)
11 ax-17 1317 . . . . 5 |- (U.{x | ph} = x -> A.yU.{x | ph} = x)
12 eqeq2 1893 . . . . 5 |- (y = x -> (U.{x | ph} = y <-> U.{x | ph} = x))
1310, 11, 12cbveu 1785 . . . 4 |- (E!yU.{x | ph} = y <-> E!xU.{x | ph} = x)
144, 6, 133bitri 194 . . 3 |- (U.{x | ph} e. _V <-> E!xU.{x | ph} = x)
153, 14sylib 215 . 2 |- (E!xph -> E!xU.{x | ph} = x)
16 euabsn 3095 . . 3 |- (E!xph <-> E.x{x | ph} = {x})
17 visset 2295 . . . . . . . 8 |- x e. _V
1817snid 3069 . . . . . . 7 |- x e. {x}
19 eleq2 1958 . . . . . . 7 |- ({x | ph} = {x} -> (x e. {x | ph} <-> x e. {x}))
2018, 19mpbiri 211 . . . . . 6 |- ({x | ph} = {x} -> x e. {x | ph})
21 abid 1873 . . . . . 6 |- (x e. {x | ph} <-> ph)
2220, 21sylib 215 . . . . 5 |- ({x | ph} = {x} -> ph)
23 unieq 3185 . . . . . 6 |- ({x | ph} = {x} -> U.{x | ph} = U.{x})
2417unisn 3193 . . . . . 6 |- U.{x} = x
2523, 24syl6eq 1944 . . . . 5 |- ({x | ph} = {x} -> U.{x | ph} = x)
2622, 25jca 310 . . . 4 |- ({x | ph} = {x} -> (ph /\ U.{x | ph} = x))
2726eximi 1387 . . 3 |- (E.x{x | ph} = {x} -> E.x(ph /\ U.{x | ph} = x))
2816, 27sylbi 216 . 2 |- (E!xph -> E.x(ph /\ U.{x | ph} = x))
29 eupickb 1836 . 2 |- ((E!xph /\ E!xU.{x | ph} = x /\ E.x(ph /\ U.{x | ph} = x)) -> (ph <-> U.{x | ph} = x))
3015, 28, 29mpd3an23 1193 1 |- (E!xph -> (ph <-> U.{x | ph} = x))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240   = wceq 1298   e. wcel 1300  E.wex 1326  E!weu 1771  {cab 1871  _Vcvv 2292  {csn 3044  U.cuni 3177
This theorem is referenced by:  reuuni1 3808  reuuni1OLD 3809  iota1 5104
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-uni 3178
Copyright terms: Public domain