Theorem sbal1 2031

Description: A theorem used in elimination of disjoint variable conditions on x , y by replacing it with a distinctor -. A. x x = z. (Contributed by NM, 5-Aug-1993.) (Proof rewitten by Jim Kingdon, 24-Feb-2018.)

Assertion

Ref	Expression
sbal1	|- ( -. A. x x = z -> ( [ z / y ] A. x ph <-> A. x [ z / y ] ph ) )

Distinct variable group:   x, y

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

Proof of Theorem sbal1

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbal 2029	. . . 4 |- ( [ w / y ] A. x ph <-> A. x [ w / y ] ph )
2	1	sbbii 1789	. . 3 |- ( [ z / w ] [ w / y ] A. x ph <-> [ z / w ] A. x [ w / y ] ph )
3		sbal1yz 2030	. . 3 |- ( -. A. x x = z -> ( [ z / w ] A. x [ w / y ] ph <-> A. x [ z / w ] [ w / y ] ph ) )
4	2, 3	bitrid 192	. 2 |- ( -. A. x x = z -> ( [ z / w ] [ w / y ] A. x ph <-> A. x [ z / w ] [ w / y ] ph ) )
5		ax-17 1550	. . 3 |- ( A. x ph -> A. w A. x ph )
6	5	sbco2vh 1974	. 2 |- ( [ z / w ] [ w / y ] A. x ph <-> [ z / y ] A. x ph )
7		ax-17 1550	. . . 4 |- ( ph -> A. w ph )
8	7	sbco2vh 1974	. . 3 |- ( [ z / w ] [ w / y ] ph <-> [ z / y ] ph )
9	8	albii 1494	. 2 |- ( A. x [ z / w ] [ w / y ] ph <-> A. x [ z / y ] ph )
10	4, 6, 9	3bitr3g 222	1 |- ( -. A. x x = z -> ( [ z / y ] A. x ph <-> A. x [ z / y ] ph ) )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 105   A.wal 1371   [wsb 1786

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-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559

This theorem depends on definitions:  df-bi 117  df-nf 1485  df-sb 1787

This theorem is referenced by: (None)