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

Theorem wl-eudf 38772
Description: Version of eu6 2602 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.)
Hypotheses
Ref Expression
wl-eudf.1 Ⅎ𝑥𝜑
wl-eudf.2 Ⅎ𝑦𝜑
wl-eudf.3 (𝜑 → ¬ ∀𝑥 𝑥 = 𝑦)
wl-eudf.4 (𝜑 → Ⅎ𝑦𝜓)
Assertion
Ref Expression
wl-eudf (𝜑 → (∃!𝑥𝜓 ↔ ∃𝑦∀𝑥(𝜓 ↔ 𝑥 = 𝑦)))

Proof of Theorem wl-eudf
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 eu6 2602 . 2 (∃!𝑥𝜓 ↔ ∃𝑢∀𝑥(𝜓 ↔ 𝑥 = 𝑢))
2 wl-eudf.2 . . 3 Ⅎ𝑦𝜑
3 wl-eudf.1 . . . 4 Ⅎ𝑥𝜑
4 wl-eudf.4 . . . . 5 (𝜑 → Ⅎ𝑦𝜓)
5 wl-eudf.3 . . . . . 6 (𝜑 → ¬ ∀𝑥 𝑥 = 𝑦)
6 nfeqf1 2411 . . . . . . 7 (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑥 = 𝑢)
76naecoms 2461 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦 𝑥 = 𝑢)
85, 7syl 18 . . . . 5 (𝜑 → Ⅎ𝑦 𝑥 = 𝑢)
94, 8nfbid 1937 . . . 4 (𝜑 → Ⅎ𝑦(𝜓 ↔ 𝑥 = 𝑢))
103, 9nfald 2362 . . 3 (𝜑 → Ⅎ𝑦∀𝑥(𝜓 ↔ 𝑥 = 𝑢))
11 nfnae 2466 . . . . . . 7 Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
12 nfeqf2 2409 . . . . . . 7 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑢 = 𝑦)
1311, 12nfan1 2240 . . . . . 6 Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑢 = 𝑦)
14 equequ2 2061 . . . . . . . 8 (𝑢 = 𝑦 → (𝑥 = 𝑢 ↔ 𝑥 = 𝑦))
1514bibi2d 345 . . . . . . 7 (𝑢 = 𝑦 → ((𝜓 ↔ 𝑥 = 𝑢) ↔ (𝜓 ↔ 𝑥 = 𝑦)))
1615adantl 487 . . . . . 6 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑢 = 𝑦) → ((𝜓 ↔ 𝑥 = 𝑢) ↔ (𝜓 ↔ 𝑥 = 𝑦)))
1713, 16albid 2262 . . . . 5 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑢 = 𝑦) → (∀𝑥(𝜓 ↔ 𝑥 = 𝑢) ↔ ∀𝑥(𝜓 ↔ 𝑥 = 𝑦)))
185, 17sylan 592 . . . 4 ((𝜑 ∧ 𝑢 = 𝑦) → (∀𝑥(𝜓 ↔ 𝑥 = 𝑢) ↔ ∀𝑥(𝜓 ↔ 𝑥 = 𝑦)))
1918ex 418 . . 3 (𝜑 → (𝑢 = 𝑦 → (∀𝑥(𝜓 ↔ 𝑥 = 𝑢) ↔ ∀𝑥(𝜓 ↔ 𝑥 = 𝑦))))
202, 10, 19cbvexd 2440 . 2 (𝜑 → (∃𝑢∀𝑥(𝜓 ↔ 𝑥 = 𝑢) ↔ ∃𝑦∀𝑥(𝜓 ↔ 𝑥 = 𝑦)))
211, 20bitrid 286 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 2596
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 1945  ax-6 2002  ax-7 2043  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404
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 2567  df-eu 2597
This theorem is used by:  wl-eutf  38773
  Copyright terms: Public domain W3C validator