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 37198
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 37197 . . 3 ∃*𝑥⊥
2 nrmo.1 . . . . . . 7 (𝑥 ∈ 𝐴 → ¬ 𝜑)
32imori 868 . . . . . 6 (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝜑)
4 ianor 997 . . . . . 6 (¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝜑))
53, 4mpbir 234 . . . . 5 ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)
65bifal 1586 . . . 4 ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ⊥)
76mobii 2574 . . 3 (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥⊥)
81, 7mpbir 234 . 2 ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)
9 df-rmo 3366 . 2 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
108, 9mpbir 234 1 ∃*𝑥 ∈ 𝐴 𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861  ⊥wfal 1582   ∈ wcel 2145  ∃*wmo 2563  ∃*wrmo 3365
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-mo 2565  df-rmo 3366
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator