Metamath Proof Explorer


Theorem dral1

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of Megill p. 448 (p. 16 of preprint). Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker dral1v if possible. (Contributed by NM, 24-Nov-1994) Remove dependency on ax-11 . (Revised by Wolf Lammen, 6-Sep-2018) (New usage is discouraged.)

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

Proof

Step Hyp Ref Expression
1 dral1.1
 |-  ( A. x x = y -> ( ph <-> ps ) )
2 nfa1
 |-  F/ x A. x x = y
3 2 1 albid
 |-  ( A. x x = y -> ( A. x ph <-> A. x ps ) )
4 axc11
 |-  ( A. x x = y -> ( A. x ps -> A. y ps ) )
5 axc11r
 |-  ( A. x x = y -> ( A. y ps -> A. x ps ) )
6 4 5 impbid
 |-  ( A. x x = y -> ( A. x ps <-> A. y ps ) )
7 3 6 bitrd
 |-  ( A. x x = y -> ( A. x ph <-> A. y ps ) )