Theorem euor2 2638

Description: Introduce or eliminate a disjunct in a unique existential quantifier. (Contributed by NM, 21-Oct-2005.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) (Proof shortened by Wolf Lammen, 27-Dec-2018.)

Assertion

Ref	Expression
euor2	⊢ (¬ ∃𝑥𝜑 → (∃!𝑥(𝜑 ∨ 𝜓) ↔ ∃!𝑥𝜓))

Proof of Theorem euor2

Step	Hyp	Ref	Expression
1		nfe1 2186	. . 3 ⊢ Ⅎ𝑥∃𝑥𝜑
2	1	nfn 1889	. 2 ⊢ Ⅎ𝑥 ¬ ∃𝑥𝜑
3		19.8a 2217	. . 3 ⊢ (𝜑 → ∃𝑥𝜑)
4		biorf 950	. . . 4 ⊢ (¬ 𝜑 → (𝜓 ↔ (𝜑 ∨ 𝜓)))
5	4	bicomd 226	. . 3 ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓) ↔ 𝜓))
6	3, 5	nsyl5 160	. 2 ⊢ (¬ ∃𝑥𝜑 → ((𝜑 ∨ 𝜓) ↔ 𝜓))
7	2, 6	eubid 2612	1 ⊢ (¬ ∃𝑥𝜑 → (∃!𝑥(𝜑 ∨ 𝜓) ↔ ∃!𝑥𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861  ∃wex 1811  ∃!weu 2593

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-12 2212

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-mo 2564  df-eu 2594

This theorem is used by:  reuun2  4269