Theorem rmoanim 3842

Description: Introduction of a conjunct into restricted "at most one" quantifier, analogous to moanim 2646. (Contributed by Alexander van der Vekens, 25-Jun-2017.) Avoid ax-10 2178 and ax-11 2194. (Revised by GG, 24-Aug-2023.)

Hypothesis

Ref	Expression
rmoanim.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
rmoanim	⊢ (∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 → ∃*𝑥 ∈ 𝐴 𝜓))

Proof of Theorem rmoanim

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		impexp 456	. . . . 5 ⊢ (((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ (𝜑 → (𝜓 → 𝑥 = 𝑦)))
2	1	ralbii 3109	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜑 → (𝜓 → 𝑥 = 𝑦)))
3		rmoanim.1	. . . . 5 ⊢ Ⅎ𝑥𝜑
4	3	r19.21 3258	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → (𝜓 → 𝑥 = 𝑦)) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
5	2, 4	bitri 278	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
6	5	exbii 1881	. 2 ⊢ (∃𝑦∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∃𝑦(𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
7		df-rmo 3366	. . 3 ⊢ (∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)))
8		dfmo 2566	. . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)) ↔ ∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦))
9		impexp 456	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
10	9	albii 1852	. . . . 5 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
11		df-ral 3078	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
12	10, 11	bitr4i 281	. . . 4 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
13	12	exbii 1881	. . 3 ⊢ (∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∃𝑦∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
14	7, 8, 13	3bitri 300	. 2 ⊢ (∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∃𝑦∀𝑥 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
15		df-rmo 3366	. . . . 5 ⊢ (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
16		dfmo 2566	. . . . 5 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 = 𝑦))
17		impexp 456	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → (𝜓 → 𝑥 = 𝑦)))
18	17	albii 1852	. . . . . . 7 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜓 → 𝑥 = 𝑦)))
19		df-ral 3078	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜓 → 𝑥 = 𝑦)))
20	18, 19	bitr4i 281	. . . . . 6 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))
21	20	exbii 1881	. . . . 5 ⊢ (∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))
22	15, 16, 21	3bitri 300	. . . 4 ⊢ (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))
23	22	imbi2i 339	. . 3 ⊢ ((𝜑 → ∃*𝑥 ∈ 𝐴 𝜓) ↔ (𝜑 → ∃𝑦∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
24		19.37v 2030	. . 3 ⊢ (∃𝑦(𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)) ↔ (𝜑 → ∃𝑦∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
25	23, 24	bitr4i 281	. 2 ⊢ ((𝜑 → ∃*𝑥 ∈ 𝐴 𝜓) ↔ ∃𝑦(𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
26	6, 14, 25	3bitr4i 306	1 ⊢ (∃*𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 → ∃*𝑥 ∈ 𝐴 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2145  ∃*wmo 2563  ∀wral 3077  ∃*wrmo 3365

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-12 2213

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-mo 2565  df-ral 3078  df-rmo 3366

This theorem is used by:  2reu1  3845  ralrmo3  39276