Theorem euor2 2613

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 2146	. . 3 ⊢ Ⅎ𝑥∃𝑥𝜑
2	1	nfn 1859	. 2 ⊢ Ⅎ𝑥 ¬ ∃𝑥𝜑
3		19.8a 2173	. . 3 ⊢ (𝜑 → ∃𝑥𝜑)
4		biorf 934	. . . 4 ⊢ (¬ 𝜑 → (𝜓 ↔ (𝜑 ∨ 𝜓)))
5	4	bicomd 222	. . 3 ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓) ↔ 𝜓))
6	3, 5	nsyl5 159	. 2 ⊢ (¬ ∃𝑥𝜑 → ((𝜑 ∨ 𝜓) ↔ 𝜓))
7	2, 6	eubid 2585	1 ⊢ (¬ ∃𝑥𝜑 → (∃!𝑥(𝜑 ∨ 𝜓) ↔ ∃!𝑥𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∨ wo 844  ∃wex 1780  ∃!weu 2566

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-10 2136  ax-12 2170

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-ex 1781  df-nf 1785  df-mo 2538  df-eu 2567

This theorem is referenced by:  reuun2  4261