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 38261
Description: Closed form of eu6 2604 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 2468 . . 3 𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2 nfa1 2189 . . 3 𝑥𝑥𝑦𝜑
31, 2nfan 1932 . 2 𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑)
4 nfnae 2468 . . 3 𝑦 ¬ ∀𝑥 𝑥 = 𝑦
5 nfnf1 2192 . . . 4 𝑦𝑦𝜑
65nfal 2358 . . 3 𝑦𝑥𝑦𝜑
74, 6nfan 1932 . 2 𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑)
8 simpl 488 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → ¬ ∀𝑥 𝑥 = 𝑦)
9 sp 2222 . . 3 (∀𝑥𝑦𝜑 → Ⅎ𝑦𝜑)
109adantl 487 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → Ⅎ𝑦𝜑)
113, 7, 8, 10wl-eudf 38260 1 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wal 1568  wex 1812  wnf 1816  ∃!weu 2598
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2569  df-eu 2599
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator