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

Theorem exsnrex 4641
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 4624 . . . . 5 𝑥 ∈ {𝑥}
2 eleq2 2850 . . . . 5 (𝑀 = {𝑥} → (𝑥 ∈ 𝑀 ↔ 𝑥 ∈ {𝑥}))
31, 2mpbiri 261 . . . 4 (𝑀 = {𝑥} → 𝑥 ∈ 𝑀)
43pm4.71ri 570 . . 3 (𝑀 = {𝑥} ↔ (𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥}))
54exbii 1881 . 2 (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥}))
6 df-rex 3088 . 2 (∃𝑥 ∈ 𝑀 𝑀 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥}))
75, 6bitr4i 281 1 (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥 ∈ 𝑀 𝑀 = {𝑥})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087  {csn 4584
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rex 3088  df-v 3453  df-sn 4585
This theorem is used by:  frgrwopreg1  30912  frgrwopreg2  30913  esplyfval1  34198
  Copyright terms: Public domain W3C validator