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

Theorem spfw 2041
 Description: Weak version of sp 2184. Uses only Tarski's FOL axiom schemes. Lemma 9 of [KalishMontague] p. 87. This may be the best we can do with minimal distinct variable conditions. (Contributed by NM, 19-Apr-2017.) (Proof shortened by Wolf Lammen, 10-Oct-2021.)
Hypotheses
Ref Expression
spfw.1 𝜓 → ∀𝑥 ¬ 𝜓)
spfw.2 (∀𝑥𝜑 → ∀𝑦𝑥𝜑)
spfw.3 𝜑 → ∀𝑦 ¬ 𝜑)
spfw.4 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
spfw (∀𝑥𝜑𝜑)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem spfw
StepHypRef Expression
1 spfw.2 . . 3 (∀𝑥𝜑 → ∀𝑦𝑥𝜑)
2 spfw.1 . . 3 𝜓 → ∀𝑥 ¬ 𝜓)
3 spfw.4 . . . 4 (𝑥 = 𝑦 → (𝜑𝜓))
43biimpd 232 . . 3 (𝑥 = 𝑦 → (𝜑𝜓))
51, 2, 4cbvaliw 2014 . 2 (∀𝑥𝜑 → ∀𝑦𝜓)
6 spfw.3 . . 3 𝜑 → ∀𝑦 ¬ 𝜑)
73biimprd 251 . . . 4 (𝑥 = 𝑦 → (𝜓𝜑))
87equcoms 2028 . . 3 (𝑦 = 𝑥 → (𝜓𝜑))
96, 8spimw 1974 . 2 (∀𝑦𝜓𝜑)
105, 9syl 17 1 (∀𝑥𝜑𝜑)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1536 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016 This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782 This theorem is referenced by:  spw  2042
 Copyright terms: Public domain W3C validator