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

Theorem sbcov 2249
Description: A composition law for substitution. Version of sbco 2511 with a disjoint variable condition using fewer axioms. (Contributed by NM, 14-May-1993.) (Revised by Gino Giotto, 7-Aug-2023.)
Assertion
Ref Expression
sbcov ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ [𝑦 / 𝑥]𝜑)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem sbcov
StepHypRef Expression
1 sbcom3vv 2098 . 2 ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑦]𝜑)
2 sbid 2248 . . 3 ([𝑦 / 𝑦]𝜑𝜑)
32sbbii 2079 . 2 ([𝑦 / 𝑥][𝑦 / 𝑦]𝜑 ↔ [𝑦 / 𝑥]𝜑)
41, 3bitri 274 1 ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ [𝑦 / 𝑥]𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 205  [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-12 2171
This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-sb 2068
This theorem is referenced by:  sb6a  2250
  Copyright terms: Public domain W3C validator