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

Theorem wl-dfreuf 34895
Description: Restricted existential uniqueness (df-wl-reu 34892) allows a simplification, if we can assume all occurrences of 𝑥 in 𝐴 are bounded. (Contributed by Wolf Lammen, 28-May-2023.)
Assertion
Ref Expression
wl-dfreuf (𝑥𝐴 → (∃!(𝑥 : 𝐴)𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑)))

Proof of Theorem wl-dfreuf
StepHypRef Expression
1 wl-dfrexf 34883 . . 3 (𝑥𝐴 → (∃(𝑥 : 𝐴)𝜑 ↔ ∃𝑥(𝑥𝐴𝜑)))
2 wl-dfrmof 34891 . . 3 (𝑥𝐴 → (∃*(𝑥 : 𝐴)𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑)))
31, 2anbi12d 632 . 2 (𝑥𝐴 → ((∃(𝑥 : 𝐴)𝜑 ∧ ∃*(𝑥 : 𝐴)𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃*𝑥(𝑥𝐴𝜑))))
4 df-wl-reu 34892 . 2 (∃!(𝑥 : 𝐴)𝜑 ↔ (∃(𝑥 : 𝐴)𝜑 ∧ ∃*(𝑥 : 𝐴)𝜑))
5 df-eu 2653 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃*𝑥(𝑥𝐴𝜑)))
63, 4, 53bitr4g 316 1 (𝑥𝐴 → (∃!(𝑥 : 𝐴)𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wex 1779  wcel 2113  ∃*wmo 2619  ∃!weu 2652  wnfc 2960  wl-rex 34868  ∃*wl-rmo 34869  ∃!wl-reu 34870
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-8 2115  ax-10 2144  ax-11 2160  ax-12 2176
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1780  df-nf 1784  df-mo 2621  df-eu 2653  df-clel 2892  df-nfc 2962  df-wl-ral 34872  df-wl-rex 34882  df-wl-rmo 34888  df-wl-reu 34892
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator