Metamath Proof Explorer


Theorem moexexvw

Description: "At most one" double quantification. Version of moexexv with an additional disjoint variable condition, which does not require ax-13 . (Contributed by NM, 26-Jan-1997) (Revised by GG, 22-Aug-2023) Factor out common proof lines with moexex . (Revised by Wolf Lammen, 2-Oct-2023)

Ref Expression
Assertion moexexvw ⊢ ∃* x φ ∧ ∀ x ∃* y ψ → ∃* y ∃ x φ ∧ ψ

Proof

Step Hyp Ref Expression
1 nfv ⊢ Ⅎ y φ
2 nfv ⊢ Ⅎ y ∃* x φ
3 nfe1 ⊢ Ⅎ x ∃ x φ ∧ ψ
4 3 nfmov ⊢ Ⅎ x ∃* y ∃ x φ ∧ ψ
5 1 2 4 moexexlem ⊢ ∃* x φ ∧ ∀ x ∃* y ψ → ∃* y ∃ x φ ∧ ψ