Theorem sbcomv 1964

Description: Version of sbcom 1968 with a distinct variable constraint between x and z. (Contributed by Jim Kingdon, 28-Feb-2018.)

Assertion

Ref	Expression
sbcomv	|- ( [ y / z ] [ y / x ] ph <-> [ y / x ] [ y / z ] ph )

Distinct variable group:   x, z

Allowed substitution hints:   ph( x, y, z)

Proof of Theorem sbcomv

Step	Hyp	Ref	Expression
1		sbco3v 1962	. 2 |- ( [ y / z ] [ z / x ] ph <-> [ y / x ] [ x / z ] ph )
2		sbcocom 1963	. 2 |- ( [ y / z ] [ z / x ] ph <-> [ y / z ] [ y / x ] ph )
3		sbcocom 1963	. 2 |- ( [ y / x ] [ x / z ] ph <-> [ y / x ] [ y / z ] ph )
4	1, 2, 3	3bitr3i 209	1 |- ( [ y / z ] [ y / x ] ph <-> [ y / x ] [ y / z ] ph )

Syntax hints:   <-> wb 104   [wsb 1755

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528

This theorem depends on definitions:  df-bi 116  df-nf 1454  df-sb 1756

This theorem is referenced by: (None)