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 35728
Description: Closed form of eu6 2574 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 2434 . . 3 𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2 nfa1 2148 . . 3 𝑥𝑥𝑦𝜑
31, 2nfan 1902 . 2 𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑)
4 nfnae 2434 . . 3 𝑦 ¬ ∀𝑥 𝑥 = 𝑦
5 nfnf1 2151 . . . 4 𝑦𝑦𝜑
65nfal 2317 . . 3 𝑦𝑥𝑦𝜑
74, 6nfan 1902 . 2 𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑)
8 simpl 483 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → ¬ ∀𝑥 𝑥 = 𝑦)
9 sp 2176 . . 3 (∀𝑥𝑦𝜑 → Ⅎ𝑦𝜑)
109adantl 482 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → Ⅎ𝑦𝜑)
113, 7, 8, 10wl-eudf 35727 1 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  wal 1537  wex 1782  wnf 1786  ∃!weu 2568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-mo 2540  df-eu 2569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator