Theorem spw 1967

Description: Weak version of the specialization scheme sp 2053. Lemma 9 of [KalishMontague] p. 87. While it appears that sp 2053 in its general form does not follow from Tarski's FOL axiom schemes, from this theorem we can prove any instance of sp 2053 having mutually distinct setvar variables and no wff metavariables (see ax12wdemo 2012 for an example of the procedure to eliminate the hypothesis). Other approximations of sp 2053 are spfw 1965 (minimal distinct variable requirements), spnfw 1928 (when x is not free in -. ph), spvw 1898 (when x does not appear in ph), sptruw 1733 (when ph is true), and spfalw 1929 (when ph is false). (Contributed by NM, 9-Apr-2017.) (Proof shortened by Wolf Lammen, 27-Feb-2018.)

Hypothesis

Ref	Expression
spw.1	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
spw	|- ( A. x ph -> ph )

Distinct variable groups:   x, y   ps, x   ph, y

Allowed substitution hints:   ph( x)   ps( y)

Proof of Theorem spw

Step	Hyp	Ref	Expression
1		ax-5 1839	. 2 |- ( -. ps -> A. x -. ps )
2		ax-5 1839	. 2 |- ( A. x ph -> A. y A. x ph )
3		ax-5 1839	. 2 |- ( -. ph -> A. y -. ph )
4		spw.1	. 2 |- ( x = y -> ( ph <-> ps ) )
5	1, 2, 3, 4	spfw 1965	1 |- ( A. x ph -> ph )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 196   A.wal 1481

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935

This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705

This theorem is referenced by:  hba1w  1974  hba1wOLD  1975  spaev  1978  ax12w  2010  bj-ssblem1  32630  bj-ax12w  32665