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

Theorem sbidm 2515
Description: An idempotent law for substitution. Usage of this theorem is discouraged because it depends on ax-13 2377. (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 2511 . 2 ([𝑦 / 𝑥][𝑥 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑥]𝜑)
2 sbid 2255 . . 3 ([𝑥 / 𝑥]𝜑𝜑)
32sbbii 2076 . 2 ([𝑦 / 𝑥][𝑥 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
41, 3bitr3i 277 1 ([𝑦 / 𝑥][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 206  [wsb 2064
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-10 2141  ax-12 2177  ax-13 2377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ex 1779  df-nf 1783  df-sb 2065
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator