Users' Mathboxes Mathbox for Anthony Hart < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nrmo Structured version   Visualization version   GIF version

Theorem nrmo 35786
Description: "At most one" restricted existential quantifier for a statement which is never true. (Contributed by Thierry Arnoux, 27-Nov-2023.)
Hypothesis
Ref Expression
nrmo.1 (𝑥𝐴 → ¬ 𝜑)
Assertion
Ref Expression
nrmo ∃*𝑥𝐴 𝜑

Proof of Theorem nrmo
StepHypRef Expression
1 mofal 35785 . . 3 ∃*𝑥
2 nrmo.1 . . . . . . 7 (𝑥𝐴 → ¬ 𝜑)
32imori 851 . . . . . 6 𝑥𝐴 ∨ ¬ 𝜑)
4 ianor 978 . . . . . 6 (¬ (𝑥𝐴𝜑) ↔ (¬ 𝑥𝐴 ∨ ¬ 𝜑))
53, 4mpbir 230 . . . . 5 ¬ (𝑥𝐴𝜑)
65bifal 1549 . . . 4 ((𝑥𝐴𝜑) ↔ ⊥)
76mobii 2534 . . 3 (∃*𝑥(𝑥𝐴𝜑) ↔ ∃*𝑥⊥)
81, 7mpbir 230 . 2 ∃*𝑥(𝑥𝐴𝜑)
9 df-rmo 3368 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
108, 9mpbir 230 1 ∃*𝑥𝐴 𝜑
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 844  wfal 1545  wcel 2098  ∃*wmo 2524  ∃*wrmo 3367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-tru 1536  df-fal 1546  df-ex 1774  df-mo 2526  df-rmo 3368
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator