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

Theorem dvelimalcased 35752
Description: Eliminate a disjoint variable condition from a universally quantified statement using cases. (Contributed by BTernaryTau, 31-Jul-2025.)
Hypotheses
Ref Expression
dvelimalcased.1 Ⅎ𝑥𝜑
dvelimalcased.2 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑧𝜑)
dvelimalcased.3 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)
dvelimalcased.4 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑧𝜃)
dvelimalcased.5 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → (𝑧 = 𝑥 → (𝜓 → 𝜃)))
dvelimalcased.6 ((𝜑 ∧ ∀𝑥 𝑥 = 𝑦) → (𝜒 → 𝜃))
dvelimalcased.7 (𝜑 → ∀𝑧𝜓)
dvelimalcased.8 (𝜑 → ∀𝑥𝜒)
Assertion
Ref Expression
dvelimalcased (𝜑 → ∀𝑥𝜃)
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)   𝜓(𝑥, 𝑦, 𝑧)   𝜒(𝑥, 𝑦, 𝑧)   𝜃(𝑥, 𝑦, 𝑧)

Proof of Theorem dvelimalcased
StepHypRef Expression
1 dvelimalcased.8 . . 3 (𝜑 → ∀𝑥𝜒)
2 dvelimalcased.1 . . . . . 6 Ⅎ𝑥𝜑
3 nfa1 2187 . . . . . 6 Ⅎ𝑥∀𝑥 𝑥 = 𝑦
42, 3nfan 1931 . . . . 5 Ⅎ𝑥(𝜑 ∧ ∀𝑥 𝑥 = 𝑦)
5 dvelimalcased.6 . . . . 5 ((𝜑 ∧ ∀𝑥 𝑥 = 𝑦) → (𝜒 → 𝜃))
64, 5alimd 2248 . . . 4 ((𝜑 ∧ ∀𝑥 𝑥 = 𝑦) → (∀𝑥𝜒 → ∀𝑥𝜃))
76ex 418 . . 3 (𝜑 → (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜒 → ∀𝑥𝜃)))
81, 7mpid 45 . 2 (𝜑 → (∀𝑥 𝑥 = 𝑦 → ∀𝑥𝜃))
9 dvelimalcased.7 . . 3 (𝜑 → ∀𝑧𝜓)
10 nfv 1946 . . . . . 6 Ⅎ𝑧 ¬ ∀𝑥 𝑥 = 𝑦
11 dvelimalcased.2 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑧𝜑)
1210, 11nfan1c 35750 . . . . 5 Ⅎ𝑧(𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦)
13 nfna1 2188 . . . . . 6 Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
142, 13nfan 1931 . . . . 5 Ⅎ𝑥(𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦)
15 dvelimalcased.3 . . . . 5 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)
16 dvelimalcased.4 . . . . 5 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑧𝜃)
17 dvelimalcased.5 . . . . 5 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → (𝑧 = 𝑥 → (𝜓 → 𝜃)))
1812, 14, 15, 16, 17cbv1v 2365 . . . 4 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → (∀𝑧𝜓 → ∀𝑥𝜃))
1918ex 418 . . 3 (𝜑 → (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑧𝜓 → ∀𝑥𝜃)))
209, 19mpid 45 . 2 (𝜑 → (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑥𝜃))
218, 20pm2.61d 181 1 (𝜑 → ∀𝑥𝜃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1567  Ⅎwnf 1815
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816
This theorem is used by:  dvelimalcasei  35753
  Copyright terms: Public domain W3C validator