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

Theorem selsALT 5409
Description: Alternate proof of sels 5408, requiring ax-sep 5249 but not using el 5406 (which is proved from it as elALT 5410). (especially when the proof of el 5406 is inlined in sels 5408). (Contributed by NM, 4-Jan-2002.) Generalize from the proof of elALT 5410. (Revised by BJ, 3-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
selsALT (𝐴 ∈ 𝑉 → ∃𝑥 𝐴 ∈ 𝑥)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem selsALT
StepHypRef Expression
1 snidg 4621 . 2 (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
2 snexg 5398 . . 3 (𝐴 ∈ {𝐴} → {𝐴} ∈ V)
3 snidg 4621 . . 3 (𝐴 ∈ {𝐴} → 𝐴 ∈ {𝐴})
4 eleq2 2850 . . 3 (𝑥 = {𝐴} → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ {𝐴}))
52, 3, 4spcedv 3553 . 2 (𝐴 ∈ {𝐴} → ∃𝑥 𝐴 ∈ 𝑥)
61, 5syl 18 1 (𝐴 ∈ 𝑉 → ∃𝑥 𝐴 ∈ 𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∃wex 1812   ∈ wcel 2145  Vcvv 3451  {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  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-un 3904  df-sn 4585  df-pr 4587
This theorem is used by:  elALT  5410
  Copyright terms: Public domain W3C validator