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

Theorem spfw 1699
 Description: Weak version of sp 1759. 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. TO DO: Do we need this theorem? If not, maybe it should be deleted. (Contributed by NM, 19-Apr-2017.)
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 ax-5 1563 . . 3
3 spfw.3 . . . 4
4 spfw.4 . . . . . 6
54biimprd 215 . . . . 5
65equcoms 1689 . . . 4
73, 6spimw 1676 . . 3
81, 2, 7syl56 32 . 2
9 spfw.1 . . 3
104biimpd 199 . . 3
119, 10spimw 1676 . 2
128, 11mpg 1554 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 177  wal 1546 This theorem is referenced by:  spnfwOLD  1700  spw  1702 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683 This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1548
 Copyright terms: Public domain W3C validator