Theorem nrmo 36376

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 36375	. . 3 ⊢ ∃*𝑥⊥
2		nrmo.1	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → ¬ 𝜑)
3	2	imori 853	. . . . . 6 ⊢ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝜑)
4		ianor 982	. . . . . 6 ⊢ (¬ (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝜑))
5	3, 4	mpbir 231	. . . . 5 ⊢ ¬ (𝑥 ∈ 𝐴 ∧ 𝜑)
6	5	bifal 1553	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ⊥)
7	6	mobii 2551	. . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥⊥)
8	1, 7	mpbir 231	. 2 ⊢ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)
9		df-rmo 3388	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
10	8, 9	mpbir 231	1 ⊢ ∃*𝑥 ∈ 𝐴 𝜑

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 846  ⊥wfal 1549   ∈ wcel 2108  ∃*wmo 2541  ∃*wrmo 3387

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-fal 1550  df-ex 1778  df-mo 2543  df-rmo 3388

This theorem is referenced by: (None)