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 38612
Description: Closed form of eu6 2599 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 2463 . . 3 Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2 nfa1 2187 . . 3 Ⅎ𝑥∀𝑥Ⅎ𝑦𝜑
31, 2nfan 1931 . 2 Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑)
4 nfnae 2463 . . 3 Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
5 nfnf1 2190 . . . 4 Ⅎ𝑦Ⅎ𝑦𝜑
65nfal 2353 . . 3 Ⅎ𝑦∀𝑥Ⅎ𝑦𝜑
74, 6nfan 1931 . 2 Ⅎ𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑)
8 simpl 488 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → ¬ ∀𝑥 𝑥 = 𝑦)
9 sp 2219 . . 3 (∀𝑥Ⅎ𝑦𝜑 → Ⅎ𝑦𝜑)
109adantl 487 . 2 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → Ⅎ𝑦𝜑)
113, 7, 8, 10wl-eudf 38611 1 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811  Ⅎwnf 1815  ∃!weu 2593
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-mo 2564  df-eu 2594
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator