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

Theorem nfsb4 2504
Description: A variable not free in a proposition remains so after substitution in that proposition with a distinct variable (inference associated with nfsb4t 2503). Theorem nfsb 2527 replaces the distinctor antecedent with a disjoint variable condition. See nfsbv 2324 for a weaker version of nfsb 2527 not requiring ax-13 2372. (Contributed by NM, 14-May-1993.) (Revised by Mario Carneiro, 4-Oct-2016.) Usage of this theorem is discouraged because it depends on ax-13 2372. Use nfsbv 2324 instead. (New usage is discouraged.)
Hypothesis
Ref Expression
nfsb4.1 𝑧𝜑
Assertion
Ref Expression
nfsb4 (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)

Proof of Theorem nfsb4
StepHypRef Expression
1 nfsb4t 2503 . 2 (∀𝑥𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
2 nfsb4.1 . 2 𝑧𝜑
31, 2mpg 1800 1 (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1537  wnf 1786  [wsb 2067
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  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-sb 2068
This theorem is referenced by:  sbco2  2515  nfsbOLD  2528
  Copyright terms: Public domain W3C validator