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

Theorem sbidm 2539
Description: An idempotent law for substitution. Usage of this theorem is discouraged because it depends on ax-13 2401. (Contributed by NM, 30-Jun-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 13-Jul-2019.) (New usage is discouraged.)
Assertion
Ref Expression
sbidm ([𝑦 / 𝑥][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)

Proof of Theorem sbidm
StepHypRef Expression
1 sbcom3 2535 . 2 ([𝑦 / 𝑥][𝑥 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑥]𝜑)
2 sbid 2290 . . 3 ([𝑥 / 𝑥]𝜑 ↔ 𝜑)
32sbbii 2112 . 2 ([𝑦 / 𝑥][𝑥 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
41, 3bitr3i 280 1 ([𝑦 / 𝑥][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  [wsb 2098
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-12 2212  ax-13 2401
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-sb 2099
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator