Metamath Proof Explorer


Theorem wl-eudf

Description: Version of eu6 with a context and a distinctor replacing a distinct variable condition. This version should be used only to eliminate disjoint variable conditions. (Contributed by Wolf Lammen, 23-Sep-2020)

Ref Expression
Hypotheses wl-eudf.1 xφ
wl-eudf.2 yφ
wl-eudf.3 φ¬xx=y
wl-eudf.4 φyψ
Assertion wl-eudf φ∃!xψyxψx=y

Proof

Step Hyp Ref Expression
1 wl-eudf.1 xφ
2 wl-eudf.2 yφ
3 wl-eudf.3 φ¬xx=y
4 wl-eudf.4 φyψ
5 eu6 ∃!xψuxψx=u
6 nfeqf1 ¬yy=xyx=u
7 6 naecoms ¬xx=yyx=u
8 3 7 syl φyx=u
9 4 8 nfbid φyψx=u
10 1 9 nfald φyxψx=u
11 nfnae x¬xx=y
12 nfeqf2 ¬xx=yxu=y
13 11 12 nfan1 x¬xx=yu=y
14 equequ2 u=yx=ux=y
15 14 bibi2d u=yψx=uψx=y
16 15 adantl ¬xx=yu=yψx=uψx=y
17 13 16 albid ¬xx=yu=yxψx=uxψx=y
18 3 17 sylan φu=yxψx=uxψx=y
19 18 ex φu=yxψx=uxψx=y
20 2 10 19 cbvexd φuxψx=uyxψx=y
21 5 20 bitrid φ∃!xψyxψx=y