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

Theorem elirrv 9355
Description: The membership relation is irreflexive: no set is a member of itself. Theorem 105 of [Suppes] p. 54. (This is trivial to prove from zfregfr 9363 and efrirr 5570, but this proof is direct from the Axiom of Regularity.) (Contributed by NM, 19-Aug-1993.)
Assertion
Ref Expression
elirrv ¬ 𝑥𝑥

Proof of Theorem elirrv
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snex 5354 . . 3 {𝑥} ∈ V
2 eleq1w 2821 . . . 4 (𝑦 = 𝑥 → (𝑦 ∈ {𝑥} ↔ 𝑥 ∈ {𝑥}))
3 vsnid 4598 . . . 4 𝑥 ∈ {𝑥}
42, 3speivw 1977 . . 3 𝑦 𝑦 ∈ {𝑥}
5 zfregcl 9353 . . 3 ({𝑥} ∈ V → (∃𝑦 𝑦 ∈ {𝑥} → ∃𝑦 ∈ {𝑥}∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥}))
61, 4, 5mp2 9 . 2 𝑦 ∈ {𝑥}∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥}
7 velsn 4577 . . . . . . 7 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
8 ax9 2120 . . . . . . . . 9 (𝑥 = 𝑦 → (𝑥𝑥𝑥𝑦))
98equcoms 2023 . . . . . . . 8 (𝑦 = 𝑥 → (𝑥𝑥𝑥𝑦))
109com12 32 . . . . . . 7 (𝑥𝑥 → (𝑦 = 𝑥𝑥𝑦))
117, 10syl5bi 241 . . . . . 6 (𝑥𝑥 → (𝑦 ∈ {𝑥} → 𝑥𝑦))
12 eleq1w 2821 . . . . . . . . 9 (𝑧 = 𝑥 → (𝑧 ∈ {𝑥} ↔ 𝑥 ∈ {𝑥}))
1312notbid 318 . . . . . . . 8 (𝑧 = 𝑥 → (¬ 𝑧 ∈ {𝑥} ↔ ¬ 𝑥 ∈ {𝑥}))
1413rspccv 3558 . . . . . . 7 (∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥} → (𝑥𝑦 → ¬ 𝑥 ∈ {𝑥}))
153, 14mt2i 137 . . . . . 6 (∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥} → ¬ 𝑥𝑦)
1611, 15nsyli 157 . . . . 5 (𝑥𝑥 → (∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥} → ¬ 𝑦 ∈ {𝑥}))
1716con2d 134 . . . 4 (𝑥𝑥 → (𝑦 ∈ {𝑥} → ¬ ∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥}))
1817ralrimiv 3102 . . 3 (𝑥𝑥 → ∀𝑦 ∈ {𝑥} ¬ ∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥})
19 ralnex 3167 . . 3 (∀𝑦 ∈ {𝑥} ¬ ∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥} ↔ ¬ ∃𝑦 ∈ {𝑥}∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥})
2018, 19sylib 217 . 2 (𝑥𝑥 → ¬ ∃𝑦 ∈ {𝑥}∀𝑧𝑦 ¬ 𝑧 ∈ {𝑥})
216, 20mt2 199 1 ¬ 𝑥𝑥
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wex 1782  wcel 2106  wral 3064  wrex 3065  Vcvv 3432  {csn 4561
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-reg 9351
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-v 3434  df-dif 3890  df-un 3892  df-nul 4257  df-sn 4562  df-pr 4564
This theorem is referenced by:  elirr  9356  nd1  10343  nd2  10344  nd3  10345  axunnd  10352  axregndlem1  10358  axregndlem2  10359  axregnd  10360  elpotr  33757  exnel  33778  distel  33779  ruvALT  40168  ralndv1  44597
  Copyright terms: Public domain W3C validator