Theorem 2reurmo 3722

Description: Double restricted quantification with restricted existential uniqueness and restricted "at most one", analogous to 2eumo 2670. (Contributed by Alexander van der Vekens, 24-Jun-2017.)

Assertion

Ref	Expression
2reurmo	⊢ (∃!𝑥 ∈ 𝐴 ∃*𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑)

Proof of Theorem 2reurmo

Step	Hyp	Ref	Expression
1		reuimrmo 3708	. 2 ⊢ (∀𝑥 ∈ 𝐴 (∃!𝑦 ∈ 𝐵 𝜑 → ∃*𝑦 ∈ 𝐵 𝜑) → (∃!𝑥 ∈ 𝐴 ∃*𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑))
2		reurmo 3372	. . 3 ⊢ (∃!𝑦 ∈ 𝐵 𝜑 → ∃*𝑦 ∈ 𝐵 𝜑)
3	2	a1i 11	. 2 ⊢ (𝑥 ∈ 𝐴 → (∃!𝑦 ∈ 𝐵 𝜑 → ∃*𝑦 ∈ 𝐵 𝜑))
4	1, 3	mprg 3085	1 ⊢ (∃!𝑥 ∈ 𝐴 ∃*𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2143  ∃!wreu 3367  ∃*wrmo 3368

This proof depends on 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

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-mo 2567  df-eu 2597  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370

This theorem is used by: (None)