HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem sbco2d 914
Description: A composition law for substitution.
Hypotheses
Ref Expression
sbco2d.1 |- (ph -> A.xph)
sbco2d.2 |- (ph -> A.zph)
sbco2d.3 |- (ph -> (ps -> A.zps))
Assertion
Ref Expression
sbco2d |- (ph -> ([y / z][z / x]ps <-> [y / x]ps))

Proof of Theorem sbco2d
StepHypRef Expression
1 sbco2d.2 . . . . 5 |- (ph -> A.zph)
2 sbco2d.3 . . . . 5 |- (ph -> (ps -> A.zps))
31, 2hbim1 781 . . . 4 |- ((ph -> ps) -> A.z(ph -> ps))
43sbco2 913 . . 3 |- ([y / z][z / x](ph -> ps) <-> [y / x](ph -> ps))
5 sbco2d.1 . . . . . 6 |- (ph -> A.xph)
65sb19.21 888 . . . . 5 |- ([z / x](ph -> ps) <-> (ph -> [z / x]ps))
76bisb 855 . . . 4 |- ([y / z][z / x](ph -> ps) <-> [y / z](ph -> [z / x]ps))
81sb19.21 888 . . . 4 |- ([y / z](ph -> [z / x]ps) <-> (ph -> [y / z][z / x]ps))
97, 8bitr 151 . . 3 |- ([y / z][z / x](ph -> ps) <-> (ph -> [y / z][z / x]ps))
105sb19.21 888 . . 3 |- ([y / x](ph -> ps) <-> (ph -> [y / x]ps))
114, 9, 103bitr3 156 . 2 |- ((ph -> [y / z][z / x]ps) <-> (ph -> [y / x]ps))
1211pm5.74ri 445 1 |- (ph -> ([y / z][z / x]ps <-> [y / x]ps))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  A.wal 672  [wsb 852
This theorem is referenced by:  sbco3 915
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853
metamath.org