Theorem ax11inda 1364

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, ax11inda2 1363 may be used instead to avoid the dummy variable w in the proof.)

Hypothesis

Ref	Expression
ax11inda.1	|- (-. A.x x = w -> (x = w -> (ph -> A.x(x = w -> ph))))

Assertion

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

Distinct variable groups:   ph,w   x,w   y,w   z,w

Proof of Theorem ax11inda

Step	Hyp	Ref	Expression
1		a9e 1121	. . 3 |- E.w w = y
2		ax11inda.1	. . . . . . 7 |- (-. A.x x = w -> (x = w -> (ph -> A.x(x = w -> ph))))
3	2	ax11inda2 1363	. . . . . 6 |- (-. A.x x = w -> (x = w -> (A.zph -> A.x(x = w -> A.zph))))
4		dveeq2 1208	. . . . . . . . 9 |- (-. A.x x = y -> (w = y -> A.x w = y))
5	4	imp 350	. . . . . . . 8 |- ((-. A.x x = y /\ w = y) -> A.x w = y)
6		hba1 1000	. . . . . . . . . 10 |- (A.x w = y -> A.xA.x w = y)
7		equequ2 1131	. . . . . . . . . . 11 |- (w = y -> (x = w <-> x = y))
8	7	a4s 981	. . . . . . . . . 10 |- (A.x w = y -> (x = w <-> x = y))
9	6, 8	albid 1100	. . . . . . . . 9 |- (A.x w = y -> (A.x x = w <-> A.x x = y))
10	9	negbid 609	. . . . . . . 8 |- (A.x w = y -> (-. A.x x = w <-> -. A.x x = y))
11	5, 10	syl 10	. . . . . . 7 |- ((-. A.x x = y /\ w = y) -> (-. A.x x = w <-> -. A.x x = y))
12	7	adantl 388	. . . . . . . 8 |- ((-. A.x x = y /\ w = y) -> (x = w <-> x = y))
13	8	imbi1d 611	. . . . . . . . . . 11 |- (A.x w = y -> ((x = w -> A.zph) <-> (x = y -> A.zph)))
14	6, 13	albid 1100	. . . . . . . . . 10 |- (A.x w = y -> (A.x(x = w -> A.zph) <-> A.x(x = y -> A.zph)))
15	5, 14	syl 10	. . . . . . . . 9 |- ((-. A.x x = y /\ w = y) -> (A.x(x = w -> A.zph) <-> A.x(x = y -> A.zph)))
16	15	imbi2d 610	. . . . . . . 8 |- ((-. A.x x = y /\ w = y) -> ((A.zph -> A.x(x = w -> A.zph)) <-> (A.zph -> A.x(x = y -> A.zph))))
17	12, 16	imbi12d 624	. . . . . . 7 |- ((-. A.x x = y /\ w = y) -> ((x = w -> (A.zph -> A.x(x = w -> A.zph))) <-> (x = y -> (A.zph -> A.x(x = y -> A.zph)))))
18	11, 17	imbi12d 624	. . . . . 6 |- ((-. A.x x = y /\ w = y) -> ((-. A.x x = w -> (x = w -> (A.zph -> A.x(x = w -> A.zph)))) <-> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))))
19	3, 18	mpbii 193	. . . . 5 |- ((-. A.x x = y /\ w = y) -> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph)))))
20	19	ex 373	. . . 4 |- (-. A.x x = y -> (w = y -> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))))
21	20	19.23adv 1209	. . 3 |- (-. A.x x = y -> (E.w w = y -> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))))
22	1, 21	mpi 44	. 2 |- (-. A.x x = y -> (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph)))))
23	22	pm2.43i 64	1 |- (-. A.x x = y -> (x = y -> (A.zph -> A.x(x = y -> A.zph))))

Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223  A.wal 951   = wceq 953  E.wex 977

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-17 968  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  df-ex 978

Copyright terms: Public domain