Theorem reuun2 4278

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 3090	. . 3 ⊢ (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
2		euor2 2641	. . 3 ⊢ (¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑) → (∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
3	1, 2	sylnbi 333	. 2 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
4		df-reu 3370	. . 3 ⊢ (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥(𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑))
5		elun 4107	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
6	5	anbi1i 635	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝜑))
7		andir 1026	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ 𝜑)))
8		orcom 883	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
9	6, 7, 8	3bitri 300	. . . 4 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
10	9	eubii 2613	. . 3 ⊢ (∃!𝑥(𝑥 ∈ (𝐴 ∪ 𝐵) ∧ 𝜑) ↔ ∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
11	4, 10	bitri 278	. 2 ⊢ (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜑)))
12		df-reu 3370	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
13	3, 11, 12	3bitr4g 317	1 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝜑 → (∃!𝑥 ∈ (𝐴 ∪ 𝐵)𝜑 ↔ ∃!𝑥 ∈ 𝐴 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860  ∃wex 1809   ∈ wcel 2143  ∃!weu 2596  ∃wrex 3089  ∃!wreu 3367   ∪ cun 3903

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-12 2213  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-rex 3090  df-reu 3370  df-v 3457  df-un 3910

This theorem is referenced by:  hdmap14lem4a  42645