Theorem dral1 1665

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). (Contributed by NM, 24-Nov-1994.)

Hypothesis

Ref	Expression
dral1.1	|- ( A. x x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
dral1	|- ( A. x x = y -> ( A. x ph <-> A. y ps ) )

Proof of Theorem dral1

Step	Hyp	Ref	Expression
1		hbae 1653	. . . 4 |- ( A. x x = y -> A. x A. x x = y )
2		dral1.1	. . . . 5 |- ( A. x x = y -> ( ph <-> ps ) )
3	2	biimpd 142	. . . 4 |- ( A. x x = y -> ( ph -> ps ) )
4	1, 3	alimdh 1401	. . 3 |- ( A. x x = y -> ( A. x ph -> A. x ps ) )
5		ax10o 1650	. . 3 |- ( A. x x = y -> ( A. x ps -> A. y ps ) )
6	4, 5	syld 44	. 2 |- ( A. x x = y -> ( A. x ph -> A. y ps ) )
7		hbae 1653	. . . 4 |- ( A. x x = y -> A. y A. x x = y )
8	2	biimprd 156	. . . 4 |- ( A. x x = y -> ( ps -> ph ) )
9	7, 8	alimdh 1401	. . 3 |- ( A. x x = y -> ( A. y ps -> A. y ph ) )
10		ax10o 1650	. . . 4 |- ( A. y y = x -> ( A. y ph -> A. x ph ) )
11	10	alequcoms 1454	. . 3 |- ( A. x x = y -> ( A. y ph -> A. x ph ) )
12	9, 11	syld 44	. 2 |- ( A. x x = y -> ( A. y ps -> A. x ph ) )
13	6, 12	impbid 127	1 |- ( A. x x = y -> ( A. x ph <-> A. y ps ) )

Syntax hints:   -> wi 4   <-> wb 103   A.wal 1287

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472

This theorem depends on definitions:  df-bi 115

This theorem is referenced by:  drnf1  1668  equveli  1689  a16g  1792