Theorem ax11inda2 1363

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

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 1271	. . . . 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 1361	. 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 951   = wceq 953

This theorem is referenced by:  ax11inda 1364

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-12 965  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206

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

Copyright terms: Public domain