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

Theorem regsfromsetind 37297
Description: Derivation of ax-regs 35767 from mh-setind 37294. (Contributed by Matthew House, 4-Mar-2026.)
Hypothesis
Ref Expression
regsfromsetind.1 (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)) → ¬ 𝜑)
Assertion
Ref Expression
regsfromsetind (∃𝑥𝜑 → ∃𝑦(∀𝑥(𝑥 = 𝑦 → 𝜑) ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem regsfromsetind
StepHypRef Expression
1 nfia1 2190 . . . . 5 Ⅎ𝑥(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑))
21nfal 2354 . . . 4 Ⅎ𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑))
32nfn 1890 . . 3 Ⅎ𝑥 ¬ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑))
4 regsfromsetind.1 . . . 4 (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)) → ¬ 𝜑)
54con2i 140 . . 3 (𝜑 → ¬ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)))
63, 5exlimi 2254 . 2 (∃𝑥𝜑 → ¬ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)))
7 exnalimn 1877 . . 3 (∃𝑦(∀𝑥(𝑥 = 𝑦 → 𝜑) ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))) ↔ ¬ ∀𝑦(∀𝑥(𝑥 = 𝑦 → 𝜑) → ¬ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
8 nfv 1947 . . . . . . 7 Ⅎ𝑧(𝑥 ∈ 𝑦 → ¬ 𝜑)
9 nfv 1947 . . . . . . . 8 Ⅎ𝑥 𝑧 ∈ 𝑦
10 nfna1 2189 . . . . . . . 8 Ⅎ𝑥 ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑)
119, 10nfim 1929 . . . . . . 7 Ⅎ𝑥(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))
12 elequ1 2152 . . . . . . . 8 (𝑥 = 𝑧 → (𝑥 ∈ 𝑦 ↔ 𝑧 ∈ 𝑦))
13 sbequ12 2287 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
14 sb6 2122 . . . . . . . . . 10 ([𝑧 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑧 → 𝜑))
1513, 14bitrdi 290 . . . . . . . . 9 (𝑥 = 𝑧 → (𝜑 ↔ ∀𝑥(𝑥 = 𝑧 → 𝜑)))
1615notbid 321 . . . . . . . 8 (𝑥 = 𝑧 → (¬ 𝜑 ↔ ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑)))
1712, 16imbi12d 347 . . . . . . 7 (𝑥 = 𝑧 → ((𝑥 ∈ 𝑦 → ¬ 𝜑) ↔ (𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
188, 11, 17cbvalv1 2371 . . . . . 6 (∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) ↔ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑)))
19 alinexa 1876 . . . . . . 7 (∀𝑥(𝑥 = 𝑦 → ¬ 𝜑) ↔ ¬ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))
20 sbalex 2279 . . . . . . 7 (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))
2119, 20xchbinx 337 . . . . . 6 (∀𝑥(𝑥 = 𝑦 → ¬ 𝜑) ↔ ¬ ∀𝑥(𝑥 = 𝑦 → 𝜑))
2218, 21imbi12i 353 . . . . 5 ((∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)) ↔ (∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑)) → ¬ ∀𝑥(𝑥 = 𝑦 → 𝜑)))
23 con2b 362 . . . . 5 ((∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑)) → ¬ ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ¬ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
2422, 23bitri 278 . . . 4 ((∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)) ↔ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ¬ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
2524albii 1852 . . 3 (∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)) ↔ ∀𝑦(∀𝑥(𝑥 = 𝑦 → 𝜑) → ¬ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
267, 25xchbinxr 338 . 2 (∃𝑦(∀𝑥(𝑥 = 𝑦 → 𝜑) ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))) ↔ ¬ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)))
276, 26sylibr 237 1 (∃𝑥𝜑 → ∃𝑦(∀𝑥(𝑥 = 𝑦 → 𝜑) ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ ∀𝑥(𝑥 = 𝑧 → 𝜑))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812  [wsb 2099
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-10 2178  ax-11 2194  ax-12 2213
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-sb 2100
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator