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

Theorem clel3 3615
Description: Alternate definition of membership in a set. (Contributed by NM, 18-Aug-1993.)
Hypothesis
Ref Expression
clel3.1 𝐵 ∈ V
Assertion
Ref Expression
clel3 (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem clel3
StepHypRef Expression
1 clel3.1 . 2 𝐵 ∈ V
2 clel3g 3614 . 2 (𝐵 ∈ V → (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥)))
31, 2ax-mp 5 1 (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  Vcvv 3450
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
This theorem is used by:  elold  28251  brcup  36794  brcap  36795
  Copyright terms: Public domain W3C validator