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

Theorem sbco 910
Description: A composition law for substitution.
Assertion
Ref Expression
sbco |- ([y / x][x / y]ph <-> [y / x]ph)

Proof of Theorem sbco
StepHypRef Expression
1 sbeq2 901 . . 3 |- [y / x]y = x
2 sbequ12 865 . . . . 5 |- (y = x -> (ph <-> [x / y]ph))
32bicomd 399 . . . 4 |- (y = x -> ([x / y]ph <-> ph))
43sbimi 854 . . 3 |- ([y / x]y = x -> [y / x]([x / y]ph <-> ph))
51, 4ax-mp 6 . 2 |- [y / x]([x / y]ph <-> ph)
6 sbbi 890 . 2 |- ([y / x]([x / y]ph <-> ph) <-> ([y / x][x / y]ph <-> [y / x]ph))
75, 6mpbi 164 1 |- ([y / x][x / y]ph <-> [y / x]ph)
Colors of variables: wff set class
Syntax hints:   <-> wb 127   = weq 797  [wsb 852
This theorem is referenced by:  sbid2 911  sbco3 915  sb5f1 917  sb9i 920
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-an 198  df-ex 679  df-sb 853
metamath.org