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

Theorem sb56 2096
 Description: Two equivalent ways of expressing the proper substitution of for in , when and are distinct. Theorem 6.2 of [Quine] p. 40. The proof does not involve df-sb 1806. The implication "to the left" is equs4 2140 and does not require any dv condition (but the version with a dv condition, equs4v 1854, requires fewer axioms). Theorem equs45f 2199 replaces the dv condition with a non-freeness hypothesis and equs5 2200 replaces it with a distinctor as antecedent. (Contributed by NM, 14-Apr-2008.) Revised to use equsexv 2085 in place of equsex 2143 in order to remove dependency on ax-13 2104. (Revised by BJ, 20-Dec-2020.)
Assertion
Ref Expression
sb56
Distinct variable group:   ,
Allowed substitution hints:   (,)

Proof of Theorem sb56
StepHypRef Expression
1 nfa1 1999 . 2
2 ax12v2 1952 . . 3
3 sp 1957 . . . 4
43com12 31 . . 3
52, 4impbid 195 . 2
61, 5equsexv 2085 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 189   wa 376  wal 1450  wex 1671 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-10 1932  ax-12 1950 This theorem depends on definitions:  df-bi 190  df-an 378  df-ex 1672  df-nf 1676 This theorem is referenced by:  sb6  2278  sb5  2279  mopick  2384  alexeqg  3156  bj-sb6  31446  bj-sb5  31447  pm13.196a  36835
 Copyright terms: Public domain W3C validator