Theorem 2reurmo 3717

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

Assertion

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

Proof of Theorem 2reurmo

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

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  ∃!wreu 3364  ∃*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

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2565  df-eu 2595  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367

This theorem is used by: (None)