Theorem spfw 2036

Description: Weak version of sp 2176. 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

Step	Hyp	Ref	Expression
1		spfw.2	. . 3 ⊢ (∀𝑥𝜑 → ∀𝑦∀𝑥𝜑)
2		spfw.1	. . 3 ⊢ (¬ 𝜓 → ∀𝑥 ¬ 𝜓)
3		spfw.4	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	3	biimpd 228	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓))
5	1, 2, 4	cbvaliw 2009	. 2 ⊢ (∀𝑥𝜑 → ∀𝑦𝜓)
6		spfw.3	. . 3 ⊢ (¬ 𝜑 → ∀𝑦 ¬ 𝜑)
7	3	biimprd 247	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜓 → 𝜑))
8	7	equcoms 2023	. . 3 ⊢ (𝑦 = 𝑥 → (𝜓 → 𝜑))
9	6, 8	spimw 1974	. 2 ⊢ (∀𝑦𝜓 → 𝜑)
10	5, 9	syl 17	1 ⊢ (∀𝑥𝜑 → 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205  ∀wal 1537

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

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783

This theorem is referenced by:  spw  2037