Users' Mathboxes Mathbox for Wolf Lammen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wl-eutf Structured version   Visualization version   GIF version

Theorem wl-eutf 34813
Description: Closed form of eu6 2658 with a distinctor avoiding distinct variable conditions. (Contributed by Wolf Lammen, 23-Sep-2020.)
Assertion
Ref Expression
wl-eutf ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦)))

Proof of Theorem wl-eutf
StepHypRef Expression
1 nfnae 2455 . . 3 𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2 nfa1 2154 . . 3 𝑥𝑥𝑦𝜑
31, 2nfan 1899 . 2 𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑)
4 nfnae 2455 . . 3 𝑦 ¬ ∀𝑥 𝑥 = 𝑦
5 nfnf1 2157 . . . 4 𝑦𝑦𝜑
65nfal 2341 . . 3 𝑦𝑥𝑦𝜑
74, 6nfan 1899 . 2 𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑)
8 simpl 485 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → ¬ ∀𝑥 𝑥 = 𝑦)
9 sp 2181 . . 3 (∀𝑥𝑦𝜑 → Ⅎ𝑦𝜑)
109adantl 484 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → Ⅎ𝑦𝜑)
113, 7, 8, 10wl-eudf 34812 1 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wal 1534  wex 1779  wnf 1783  ∃!weu 2652
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-10 2144  ax-11 2160  ax-12 2176  ax-13 2389
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-mo 2621  df-eu 2653
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator