Theorem reu3 3716

Description: A way to express restricted uniqueness. (Contributed by NM, 24-Oct-2006.)

Assertion

Ref	Expression
reu3	⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reu3

Step	Hyp	Ref	Expression
1		reurex 3430	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜑)
2		reu6 3715	. . . 4 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦))
3		biimp 217	. . . . . 6 ⊢ ((𝜑 ↔ 𝑥 = 𝑦) → (𝜑 → 𝑥 = 𝑦))
4	3	ralimi 3158	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦) → ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))
5	4	reximi 3241	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))
6	2, 5	sylbi 219	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 → ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))
7	1, 6	jca 514	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 → (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)))
8		rexex 3238	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))
9	8	anim2i 618	. . 3 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) → (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)))
10		eu3v 2649	. . . 4 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦)))
11		df-reu 3143	. . . 4 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
12		df-rex 3142	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
13		df-ral 3141	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝑥 = 𝑦)))
14		impexp 453	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → (𝜑 → 𝑥 = 𝑦)))
15	14	albii 1814	. . . . . . 7 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝑥 = 𝑦)))
16	13, 15	bitr4i 280	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦))
17	16	exbii 1842	. . . . 5 ⊢ (∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) ↔ ∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦))
18	12, 17	anbi12i 628	. . . 4 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦)))
19	10, 11, 18	3bitr4i 305	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)))
20	9, 19	sylibr 236	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) → ∃!𝑥 ∈ 𝐴 𝜑)
21	7, 20	impbii 211	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1529  ∃wex 1774   ∈ wcel 2108  ∃!weu 2647  ∀wral 3136  ∃wrex 3137  ∃!wreu 3138

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-10 2139  ax-12 2170

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clel 2891  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144

This theorem is referenced by:  reu7  3721  2reu4lem  4463  reu3op  6136