Theorem sbal1 1328

Description: A theorem used in elimination of disjoint variable restriction on x and y by replacing it with a distinctor -. A.xx = z.

Assertion

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

Distinct variable group:   x,y

Proof of Theorem sbal1

Step	Hyp	Ref	Expression
1		sbequ12 1164	. . . . 5 |- (y = z -> (A.xph <-> [z / y]A.xph))
2	1	a4s 960	. . . 4 |- (A.y y = z -> (A.xph <-> [z / y]A.xph))
3		sbequ12 1164	. . . . . 6 |- (y = z -> (ph <-> [z / y]ph))
4	3	a4s 960	. . . . 5 |- (A.y y = z -> (ph <-> [z / y]ph))
5	4	dral2 1138	. . . 4 |- (A.y y = z -> (A.xph <-> A.x[z / y]ph))
6	2, 5	bitr3d 528	. . 3 |- (A.y y = z -> ([z / y]A.xph <-> A.x[z / y]ph))
7	6	a1d 12	. 2 |- (A.y y = z -> (-. A.x x = z -> ([z / y]A.xph <-> A.x[z / y]ph)))
8		hba1 979	. . . . . . 7 |- (A.xph -> A.xA.xph)
9	8	hbsb4 1232	. . . . . 6 |- (-. A.x x = z -> ([z / y]A.xph -> A.x[z / y]A.xph))
10		ax-4 951	. . . . . . . 8 |- (A.xph -> ph)
11	10	sbimi 1156	. . . . . . 7 |- ([z / y]A.xph -> [z / y]ph)
12	11	19.20i 968	. . . . . 6 |- (A.x[z / y]A.xph -> A.x[z / y]ph)
13	9, 12	syl6 22	. . . . 5 |- (-. A.x x = z -> ([z / y]A.xph -> A.x[z / y]ph))
14	13	adantl 388	. . . 4 |- ((-. A.y y = z /\ -. A.x x = z) -> ([z / y]A.xph -> A.x[z / y]ph))
15		sb4 1207	. . . . . . . 8 |- (-. A.y y = z -> ([z / y]ph -> A.y(y = z -> ph)))
16	15	19.20ii 971	. . . . . . 7 |- (A.x -. A.y y = z -> (A.x[z / y]ph -> A.xA.y(y = z -> ph)))
17	16	hbnaes 1131	. . . . . 6 |- (-. A.y y = z -> (A.x[z / y]ph -> A.xA.y(y = z -> ph)))
18		ax-7 954	. . . . . 6 |- (A.xA.y(y = z -> ph) -> A.yA.x(y = z -> ph))
19	17, 18	syl6 22	. . . . 5 |- (-. A.y y = z -> (A.x[z / y]ph -> A.yA.x(y = z -> ph)))
20		ax-16 1194	. . . . . . . . . . 11 |- (A.x x = y -> (y = z -> A.x y = z))
21	20	a1d 12	. . . . . . . . . 10 |- (A.x x = y -> (-. A.x x = z -> (y = z -> A.x y = z)))
22		ax-12 1104	. . . . . . . . . 10 |- (-. A.x x = y -> (-. A.x x = z -> (y = z -> A.x y = z)))
23	21, 22	pm2.61i 126	. . . . . . . . 9 |- (-. A.x x = z -> (y = z -> A.x y = z))
24		19.20 970	. . . . . . . . 9 |- (A.x(y = z -> ph) -> (A.x y = z -> A.xph))
25	23, 24	syl9 57	. . . . . . . 8 |- (-. A.x x = z -> (A.x(y = z -> ph) -> (y = z -> A.xph)))
26	25	19.20ii 971	. . . . . . 7 |- (A.y -. A.x x = z -> (A.yA.x(y = z -> ph) -> A.y(y = z -> A.xph)))
27		sb2 1160	. . . . . . 7 |- (A.y(y = z -> A.xph) -> [z / y]A.xph)
28	26, 27	syl6 22	. . . . . 6 |- (A.y -. A.x x = z -> (A.yA.x(y = z -> ph) -> [z / y]A.xph))
29	28	hbnaes 1131	. . . . 5 |- (-. A.x x = z -> (A.yA.x(y = z -> ph) -> [z / y]A.xph))
30	19, 29	sylan9 468	. . . 4 |- ((-. A.y y = z /\ -. A.x x = z) -> (A.x[z / y]ph -> [z / y]A.xph))
31	14, 30	impbid 514	. . 3 |- ((-. A.y y = z /\ -. A.x x = z) -> ([z / y]A.xph <-> A.x[z / y]ph))
32	31	ex 373	. 2 |- (-. A.y y = z -> (-. A.x x = z -> ([z / y]A.xph <-> A.x[z / y]ph)))
33	7, 32	pm2.61i 126	1 |- (-. A.x x = z -> ([z / y]A.xph <-> A.x[z / y]ph))

Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223  A.wal 950   = wceq 1099  [wsbc 1153

This theorem is referenced by:  sbal 1329

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-16 1194  ax-11o 1202

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 957  df-sb 1155

Copyright terms: Public domain