Theorem reuun2 4271

Description: Transfer uniqueness to a smaller or larger class. (Contributed by NM, 21-Oct-2005.) (Proof shortened by Wolf Lammen, 15-May-2025.)

Assertion

Ref	Expression
reuun2	⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥 ∈ 𝐴 𝜑))

Proof of Theorem reuun2

Step	Hyp	Ref	Expression
1		df-rex 3088	. . 3 ⊢ (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
2		euor2 2639	. . 3 ⊢ (¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑) → (∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
3	1, 2	sylnbi 333	. 2 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
4		df-reu 3367	. . 3 ⊢ (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥(𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑))
5		elun 4100	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
6	5	anbi1i 636	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝜑))
7		andir 1026	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ 𝜑)))
8		orcom 884	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
9	6, 7, 8	3bitri 300	. . . 4 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
10	9	eubii 2611	. . 3 ⊢ (∃!𝑥(𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
11	4, 10	bitri 278	. 2 ⊢ (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
12		df-reu 3367	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
13	3, 11, 12	3bitr4g 317	1 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥 ∈ 𝐴 𝜑))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∃wex 1812   ∈ wcel 2145  ∃!weu 2594  ∃wrex 3087  ∃!wreu 3364   ∪ cun 3897

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  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-rex 3088  df-reu 3367  df-v 3453  df-un 3904

This theorem is used by:  hdmap14lem4a  42928