Metamath Proof Explorer


Theorem dral1v

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Version of dral1 with a disjoint variable condition, which does not require ax-13 . Remark: the corresponding versions for dral2 and drex2 are instances of albidv and exbidv respectively. (Contributed by NM, 24-Nov-1994) (Revised by BJ, 17-Jun-2019) Base the proof on ax12v . (Revised by Wolf Lammen, 30-Mar-2024) Avoid ax-10 . (Revised by Gino Giotto, 18-Nov-2024)

Ref Expression
Hypothesis dral1v.1 xx=yφψ
Assertion dral1v xx=yxφyψ

Proof

Step Hyp Ref Expression
1 dral1v.1 xx=yφψ
2 hbaev xx=yxxx=y
3 2 1 albidh xx=yxφxψ
4 axc11v xx=yxψyψ
5 axc11rv xx=yyψxψ
6 4 5 impbid xx=yxψyψ
7 3 6 bitrd xx=yxφyψ