Theorem reuan 3851

Description: Introduction of a conjunct into restricted unique existential quantifier, analogous to euan 2651. (Contributed by Alexander van der Vekens, 2-Jul-2017.)

Hypothesis

Ref	Expression
rmoanim.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
reuan	⊢ (∃!𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜓))

Proof of Theorem reuan

Step	Hyp	Ref	Expression
1		rmoanim.1	. . . . . 6 ⊢ Ⅎ𝑥𝜑
2		simpl 488	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝜑)
3	2	a1i 11	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝜑))
4	1, 3	rexlimi 3267	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → 𝜑)
5	4	adantr 486	. . . 4 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ ∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)) → 𝜑)
6		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜓)
7	6	reximi 3105	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∃𝑥 ∈ 𝐴 𝜓)
8	7	adantr 486	. . . 4 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ ∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)) → ∃𝑥 ∈ 𝐴 𝜓)
9		nfre1 3292	. . . . . 6 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)
10	4	adantr 486	. . . . . . . . 9 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → 𝜑)
11	10	a1d 26	. . . . . . . 8 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → (𝜓 → 𝜑))
12	11	ancrd 561	. . . . . . 7 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → (𝜓 → (𝜑 ∧ 𝜓)))
13	6, 12	impbid2 229	. . . . . 6 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ 𝜓) ↔ 𝜓))
14	9, 13	rmobida 3394	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → (∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∃*𝑥 ∈ 𝐴 𝜓))
15	14	biimpa 482	. . . 4 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ ∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)) → ∃*𝑥 ∈ 𝐴 𝜓)
16	5, 8, 15	jca32 525	. . 3 ⊢ ((∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ ∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)) → (𝜑 ∧ (∃𝑥 ∈ 𝐴 𝜓 ∧ ∃*𝑥 ∈ 𝐴 𝜓)))
17		reu5 3373	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ ∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)))
18		reu5 3373	. . . 4 ⊢ (∃!𝑥 ∈ 𝐴 𝜓 ↔ (∃𝑥 ∈ 𝐴 𝜓 ∧ ∃*𝑥 ∈ 𝐴 𝜓))
19	18	anbi2i 635	. . 3 ⊢ ((𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜓) ↔ (𝜑 ∧ (∃𝑥 ∈ 𝐴 𝜓 ∧ ∃*𝑥 ∈ 𝐴 𝜓)))
20	16, 17, 19	3imtr4i 295	. 2 ⊢ (∃!𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → (𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜓))
21		ibar 538	. . . . 5 ⊢ (𝜑 → (𝜓 ↔ (𝜑 ∧ 𝜓)))
22	21	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ (𝜑 ∧ 𝜓)))
23	1, 22	reubida 3395	. . 3 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐴 𝜓 ↔ ∃!𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)))
24	23	biimpa 482	. 2 ⊢ ((𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜓) → ∃!𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓))
25	20, 24	impbii 212	1 ⊢ (∃!𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥 ∈ 𝐴 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  Ⅎwnf 1816   ∈ wcel 2146  ∃wrex 3091  ∃!wreu 3369  ∃*wrmo 3370

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-10 2179  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-mo 2569  df-eu 2599  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372

This theorem is used by:  2reu7  47881  2reu8  47882