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

Theorem sbco2d 1258
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 1105 . . . 4 |- ((ph -> ps) -> A.z(ph -> ps))
43sbco2 1257 . . 3 |- ([y / z][z / x](ph -> ps) <-> [y / x](ph -> ps))
5 sbco2d.1 . . . . . 6 |- (ph -> A.xph)
65sb19.21 1238 . . . . 5 |- ([z / x](ph -> ps) <-> (ph -> [z / x]ps))
76sbbii 1176 . . . 4 |- ([y / z][z / x](ph -> ps) <-> [y / z](ph -> [z / x]ps))
81sb19.21 1238 . . . 4 |- ([y / z](ph -> [z / x]ps) <-> (ph -> [y / z][z / x]ps))
97, 8bitr 173 . . 3 |- ([y / z][z / x](ph -> ps) <-> (ph -> [y / z][z / x]ps))
105sb19.21 1238 . . 3 |- ([y / x](ph -> ps) <-> (ph -> [y / x]ps))
114, 9, 103bitr3 181 . 2 |- ((ph -> [y / z][z / x]ps) <-> (ph -> [y / x]ps))
1211pm5.74ri 589 1 |- (ph -> ([y / z][z / x]ps <-> [y / x]ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 956  [wsbc 1172
This theorem is referenced by:  sbco3 1259
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-11o 1220
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174
Copyright terms: Public domain