Theorem reuun2 4253

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 3064	. . 3 ⊢ (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
2		euor2 2617	. . 3 ⊢ (¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑) → (∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
3	1, 2	sylnbi 331	. 2 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
4		df-reu 3345	. . 3 ⊢ (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥(𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑))
5		elun 4083	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
6	5	anbi1i 630	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝜑))
7		andir 1016	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ 𝜑)))
8		orcom 876	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
9	6, 7, 8	3bitri 298	. . . 4 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
10	9	eubii 2589	. . 3 ⊢ (∃!𝑥(𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
11	4, 10	bitri 276	. 2 ⊢ (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
12		df-reu 3345	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
13	3, 11, 12	3bitr4g 315	1 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥 ∈ 𝐴 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∨ wo 853  ∃wex 1786   ∈ wcel 2119  ∃!weu 2572  ∃wrex 3063  ∃!wreu 3342   ∪ cun 3881

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-12 2189  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-rex 3064  df-reu 3345  df-v 3433  df-un 3888

This theorem is referenced by:  hdmap14lem4a  42363