Metamath Proof Explorer


Theorem sbt

Description: A substitution into a theorem yields a theorem. See sbtALT for a shorter proof requiring more axioms. See chvar and chvarv for versions using implicit substitution. (Contributed by NM, 21-Jan-2004) (Proof shortened by Andrew Salmon, 25-May-2011) (Proof shortened by Wolf Lammen, 20-Jul-2018) Revise df-sb . (Revised by Steven Nguyen, 6-Jul-2023) Revise df-sb again. (Revised by Wolf Lammen, 4-Feb-2026)

Ref Expression
Hypothesis sbt.1 ⊢ φ
Assertion sbt ⊢ t x φ

Proof

Step Hyp Ref Expression
1 sbt.1 ⊢ φ
2 1 sbtlem ⊢ ∀ y y = t → ∀ x x = y → φ
3 1 sbtlem ⊢ ∀ z z = t → ∀ x x = z → φ
4 2 3 2th ⊢ ∀ y y = t → ∀ x x = y → φ ↔ ∀ z z = t → ∀ x x = z → φ
5 4 df-sb ⊢ t x φ ↔ ∀ y y = t → ∀ x x = y → φ
6 2 5 mpbir ⊢ t x φ