Theorem sbcomv 1971

Description: Version of sbcom 1975 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 1969	. 2 |- ( [ y / z ] [ z / x ] ph <-> [ y / x ] [ x / z ] ph )
2		sbcocom 1970	. 2 |- ( [ y / z ] [ z / x ] ph <-> [ y / z ] [ y / x ] ph )
3		sbcocom 1970	. 2 |- ( [ y / x ] [ x / z ] ph <-> [ y / x ] [ y / z ] ph )
4	1, 2, 3	3bitr3i 210	1 |- ( [ y / z ] [ y / x ] ph <-> [ y / x ] [ y / z ] ph )

Syntax hints:   <-> wb 105   [wsb 1762

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763

This theorem is referenced by: (None)