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

Theorem sbco 2154
Description: A composition law for substitution. (Contributed by NM, 14-May-1993.) (Proof shortened by Wolf Lammen, 21-Sep-2018.)
Assertion
Ref Expression
sbco

Proof of Theorem sbco
StepHypRef Expression
1 sbcom3 2153 . 2
2 sbid 1996 . . 3
32sbbii 1746 . 2
41, 3bitri 249 1
Colors of variables: wff setvar class
Syntax hints:  <->wb 184  [wsb 1739
This theorem is referenced by:  sbid2  2155  sbco3  2160  sb6a  2192
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-12 1854  ax-13 1999
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-ex 1613  df-nf 1617  df-sb 1740
  Copyright terms: Public domain W3C validator