Theorem nrmo 36809

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

Step	Hyp	Ref	Expression
1		mofal 36808	. . 3 ⊢ ∃*𝑥⊥
2		nrmo.1	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → ¬ 𝜑)
3	2	imori 867	. . . . . 6 ⊢ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝜑)
4		ianor 997	. . . . . 6 ⊢ (¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝜑))
5	3, 4	mpbir 234	. . . . 5 ⊢ ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)
6	5	bifal 1583	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ⊥)
7	6	mobii 2582	. . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥⊥)
8	1, 7	mpbir 234	. 2 ⊢ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)
9		df-rmo 3376	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
10	8, 9	mpbir 234	1 ⊢ ∃*𝑥 ∈ 𝐴 𝜑

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ wo 860  ⊥wfal 1579   ∈ wcel 2149  ∃*wmo 2571  ∃*wrmo 3375

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-fal 1580  df-ex 1807  df-mo 2573  df-rmo 3376

This theorem is referenced by: (None)