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

Theorem sbco 2506
Description: A composition law for substitution. Usage of this theorem is discouraged because it depends on ax-13 2371. See sbcov 2257 for a version with a disjoint variable condition requiring fewer axioms. (Contributed by NM, 14-May-1993.) (Proof shortened by Wolf Lammen, 21-Sep-2018.) (New usage is discouraged.)
Assertion
Ref Expression
sbco ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ [𝑦 / 𝑥]𝜑)

Proof of Theorem sbco
StepHypRef Expression
1 sbcom3 2505 . 2 ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ [𝑦 / 𝑥][𝑦 / 𝑦]𝜑)
2 sbid 2256 . . 3 ([𝑦 / 𝑦]𝜑𝜑)
32sbbii 2077 . 2 ([𝑦 / 𝑥][𝑦 / 𝑦]𝜑 ↔ [𝑦 / 𝑥]𝜑)
41, 3bitri 275 1 ([𝑦 / 𝑥][𝑥 / 𝑦]𝜑 ↔ [𝑦 / 𝑥]𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 206  [wsb 2065
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-10 2142  ax-12 2178  ax-13 2371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1780  df-nf 1784  df-sb 2066
This theorem is referenced by:  sbid2  2507  sbco3  2512
  Copyright terms: Public domain W3C validator