Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  axnulg Structured version   Visualization version   GIF version

Theorem axnulg 35926
Description: A generalization of ax-nul 5264 in which 𝑥 and 𝑦 need not be distinct. This theorem scheme bundles ax-nul 5264 with the degenerate instance ∃𝑥∀𝑥¬ 𝑥 ∈ 𝑥 which is satisfied by elirrv 9621. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by BTernaryTau, 3-Aug-2025.) (New usage is discouraged.)
Assertion
Ref Expression
axnulg ∃𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥

Proof of Theorem axnulg
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfnae 2466 . . 3 Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
2 nfcvf 2952 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦)
3 nfcvd 2927 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑧)
42, 3nfeld 2937 . . . 4 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 ∈ 𝑧)
54nfnd 1891 . . 3 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 ¬ 𝑦 ∈ 𝑧)
61, 5nfald 2362 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥∀𝑦 ¬ 𝑦 ∈ 𝑧)
7 nfvd 1950 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑧∀𝑦 ¬ 𝑦 ∈ 𝑥)
8 dveeq2 2410 . . . 4 (¬ ∀𝑦 𝑦 = 𝑥 → (𝑧 = 𝑥 → ∀𝑦 𝑧 = 𝑥))
98naecoms 2461 . . 3 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑥 → ∀𝑦 𝑧 = 𝑥))
10 elequ2 2162 . . . . . 6 (𝑧 = 𝑥 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑥))
1110notbid 321 . . . . 5 (𝑧 = 𝑥 → (¬ 𝑦 ∈ 𝑧 ↔ ¬ 𝑦 ∈ 𝑥))
1211biimpd 232 . . . 4 (𝑧 = 𝑥 → (¬ 𝑦 ∈ 𝑧 → ¬ 𝑦 ∈ 𝑥))
1312al2imi 1848 . . 3 (∀𝑦 𝑧 = 𝑥 → (∀𝑦 ¬ 𝑦 ∈ 𝑧 → ∀𝑦 ¬ 𝑦 ∈ 𝑥))
149, 13syl6 36 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑥 → (∀𝑦 ¬ 𝑦 ∈ 𝑧 → ∀𝑦 ¬ 𝑦 ∈ 𝑥)))
15 elequ1 2154 . . . . . 6 (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
1615notbid 321 . . . . 5 (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑥))
1716sps 2225 . . . 4 (∀𝑥 𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑥))
1817dral1 2471 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ¬ 𝑦 ∈ 𝑥))
1918biimpd 232 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 ¬ 𝑥 ∈ 𝑥 → ∀𝑦 ¬ 𝑦 ∈ 𝑥))
20 ax-nul 5264 . 2 ∃𝑧∀𝑦 ¬ 𝑦 ∈ 𝑧
21 elirrv 9621 . . . 4 ¬ 𝑥 ∈ 𝑥
2221ax-gen 1828 . . 3 ∀𝑥 ¬ 𝑥 ∈ 𝑥
2322exgen 2009 . 2 ∃𝑥∀𝑥 ¬ 𝑥 ∈ 𝑥
246, 7, 14, 19, 20, 23dvelimexcasei 35791 1 ∃𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1568  ∃wex 1812
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-10 2180  ax-11 2197  ax-12 2216  ax-13 2404  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-reg 9616
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2755  df-clel 2839  df-nfc 2913
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator