Theorem dral1 1965

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.xph <-> A.yps))

Proof of Theorem dral1

Step	Hyp	Ref	Expression
1		hbae 1953	. . . 4 |- (A.x x = y -> A.xA.x x = y)
2		dral1.1	. . . . 5 |- (A.x x = y -> (ph <-> ps))
3	2	biimpd 198	. . . 4 |- (A.x x = y -> (ph -> ps))
4	1, 3	alimdh 1563	. . 3 |- (A.x x = y -> (A.xph -> A.xps))
5		ax10o 1952	. . 3 |- (A.x x = y -> (A.xps -> A.yps))
6	4, 5	syld 40	. 2 |- (A.x x = y -> (A.xph -> A.yps))
7		hbae 1953	. . . 4 |- (A.x x = y -> A.yA.x x = y)
8	2	biimprd 214	. . . 4 |- (A.x x = y -> (ps -> ph))
9	7, 8	alimdh 1563	. . 3 |- (A.x x = y -> (A.yps -> A.yph))
10		ax10o 1952	. . . 4 |- (A.y y = x -> (A.yph -> A.xph))
11	10	aecoms 1947	. . 3 |- (A.x x = y -> (A.yph -> A.xph))
12	9, 11	syld 40	. 2 |- (A.x x = y -> (A.yps -> A.xph))
13	6, 12	impbid 183	1 |- (A.x x = y -> (A.xph <-> A.yps))

Syntax hints:   -> wi 4   <-> wb 176  A.wal 1540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925

This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545

This theorem is referenced by:  drex1  1967  drnf1  1969  equveli  1988  a16gALT  2049  sb9i  2094  ralcom2  2776