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

Theorem intid 5367
Description: The intersection of all sets to which a set belongs is the singleton of that set. (Contributed by NM, 5-Jun-2009.)
Hypothesis
Ref Expression
intid.1 𝐴 ∈ V
Assertion
Ref Expression
intid {𝑥𝐴𝑥} = {𝐴}
Distinct variable group:   𝑥,𝐴

Proof of Theorem intid
StepHypRef Expression
1 snex 5349 . . 3 {𝐴} ∈ V
2 eleq2 2827 . . . 4 (𝑥 = {𝐴} → (𝐴𝑥𝐴 ∈ {𝐴}))
3 intid.1 . . . . 5 𝐴 ∈ V
43snid 4594 . . . 4 𝐴 ∈ {𝐴}
52, 4intmin3 4904 . . 3 ({𝐴} ∈ V → {𝑥𝐴𝑥} ⊆ {𝐴})
61, 5ax-mp 5 . 2 {𝑥𝐴𝑥} ⊆ {𝐴}
73elintab 4887 . . . 4 (𝐴 {𝑥𝐴𝑥} ↔ ∀𝑥(𝐴𝑥𝐴𝑥))
8 id 22 . . . 4 (𝐴𝑥𝐴𝑥)
97, 8mpgbir 1803 . . 3 𝐴 {𝑥𝐴𝑥}
10 snssi 4738 . . 3 (𝐴 {𝑥𝐴𝑥} → {𝐴} ⊆ {𝑥𝐴𝑥})
119, 10ax-mp 5 . 2 {𝐴} ⊆ {𝑥𝐴𝑥}
126, 11eqssi 3933 1 {𝑥𝐴𝑥} = {𝐴}
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2108  {cab 2715  Vcvv 3422  wss 3883  {csn 4558   cint 4876
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-sn 4559  df-pr 4561  df-int 4877
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator