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

Theorem elirrvOLDOLD 9620
Description: Obsolete version of elirrv 9618 as of 27-Dec-2025. (Contributed by NM, 19-Aug-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
elirrvOLDOLD ¬ 𝑥 ∈ 𝑥

Proof of Theorem elirrvOLDOLD
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vsnex 5397 . . 3 {𝑥} ∈ V
2 eleq1w 2847 . . . 4 (𝑦 = 𝑥 → (𝑦 ∈ {𝑥} ↔ 𝑥 ∈ {𝑥}))
3 vsnid 4624 . . . 4 𝑥 ∈ {𝑥}
42, 3speivw 2008 . . 3 ∃𝑦 𝑦 ∈ {𝑥}
5 zfregcl 9615 . . 3 ({𝑥} ∈ V → (∃𝑦 𝑦 ∈ {𝑥} → ∃𝑦 ∈ {𝑥}∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥}))
61, 4, 5mp2 9 . 2 ∃𝑦 ∈ {𝑥}∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥}
7 velsn 4600 . . . . . . 7 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
8 ax9 2161 . . . . . . . . 9 (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 → 𝑥 ∈ 𝑦))
98equcoms 2055 . . . . . . . 8 (𝑦 = 𝑥 → (𝑥 ∈ 𝑥 → 𝑥 ∈ 𝑦))
109com12 33 . . . . . . 7 (𝑥 ∈ 𝑥 → (𝑦 = 𝑥 → 𝑥 ∈ 𝑦))
117, 10biimtrid 245 . . . . . 6 (𝑥 ∈ 𝑥 → (𝑦 ∈ {𝑥} → 𝑥 ∈ 𝑦))
12 eleq1w 2847 . . . . . . . . 9 (𝑧 = 𝑥 → (𝑧 ∈ {𝑥} ↔ 𝑥 ∈ {𝑥}))
1312notbid 321 . . . . . . . 8 (𝑧 = 𝑥 → (¬ 𝑧 ∈ {𝑥} ↔ ¬ 𝑥 ∈ {𝑥}))
1413rspccv 3577 . . . . . . 7 (∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥} → (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ {𝑥}))
153, 14mt2i 138 . . . . . 6 (∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥} → ¬ 𝑥 ∈ 𝑦)
1611, 15nsyli 158 . . . . 5 (𝑥 ∈ 𝑥 → (∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥} → ¬ 𝑦 ∈ {𝑥}))
1716con2d 135 . . . 4 (𝑥 ∈ 𝑥 → (𝑦 ∈ {𝑥} → ¬ ∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥}))
1817ralrimiv 3157 . . 3 (𝑥 ∈ 𝑥 → ∀𝑦 ∈ {𝑥} ¬ ∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥})
19 ralnex 3092 . . 3 (∀𝑦 ∈ {𝑥} ¬ ∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥} ↔ ¬ ∃𝑦 ∈ {𝑥}∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥})
2018, 19sylib 221 . 2 (𝑥 ∈ 𝑥 → ¬ ∃𝑦 ∈ {𝑥}∀𝑧 ∈ 𝑦 ¬ 𝑧 ∈ {𝑥})
216, 20mt2 203 1 ¬ 𝑥 ∈ 𝑥
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454  {csn 4588
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395  ax-reg 9613
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-un 4154  df-sn 4589  df-pr 4591
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator