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

Theorem exsnrex 4637
Description: There is a set being the element of a singleton if and only if there is an element of the singleton. (Contributed by Alexander van der Vekens, 1-Jan-2018.)
Assertion
Ref Expression
exsnrex (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥 ∈ 𝑀 𝑀 = {𝑥})

Proof of Theorem exsnrex
StepHypRef Expression
1 vsnid 4620 . . . . 5 𝑥 ∈ {𝑥}
2 eleq2 2849 . . . . 5 (𝑀 = {𝑥} → (𝑥 ∈ 𝑀 ↔ 𝑥 ∈ {𝑥}))
31, 2mpbiri 261 . . . 4 (𝑀 = {𝑥} → 𝑥 ∈ 𝑀)
43pm4.71ri 570 . . 3 (𝑀 = {𝑥} ↔ (𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥}))
54exbii 1880 . 2 (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥}))
6 df-rex 3087 . 2 (∃𝑥 ∈ 𝑀 𝑀 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥}))
75, 6bitr4i 281 1 (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥 ∈ 𝑀 𝑀 = {𝑥})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086  {csn 4584
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-v 3452  df-sn 4585
This theorem is used by:  frgrwopreg1  30925  frgrwopreg2  30926  esplyfval1  34252
  Copyright terms: Public domain W3C validator