Theorem ax11inda2 1347

Description: Induction step for constructing a substitution instance of ax-11o 1202 without using ax-11o 1202. Quantification case. When z and y are distinct, this theorem avoids the dummy variables needed by the more general ax11inda 1348.

Hypothesis

Ref	Expression
ax11inda2.1	|- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))

Assertion

Ref	Expression
ax11inda2	|- (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))

Distinct variable group:   y,z

Proof of Theorem ax11inda2

Step	Hyp	Ref	Expression
1		a16g 1258	. . . . 5 |- (A.y y = z -> ((x = y -> A.zph) -> A.x(x = y -> A.zph)))
2		ax-1 4	. . . . 5 |- (A.zph -> (x = y -> A.zph))
3	1, 2	syl5 21	. . . 4 |- (A.y y = z -> (A.zph -> A.x(x = y -> A.zph)))
4	3	a1d 12	. . 3 |- (A.y y = z -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))
5	4	a1d 12	. 2 |- (A.y y = z -> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph)))))
6		ax11inda2.1	. . 3 |- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))
7	6	ax11indalem 1345	. 2 |- (-. A.y y = z -> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph)))))
8	5, 7	pm2.61i 126	1 |- (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))

Syntax hints:  -. wn 2   -> wi 3  A.wal 950   = wceq 1099

This theorem is referenced by:  ax11inda 1348

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

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

Copyright terms: Public domain