Theorem moexexvw 2631

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

Assertion

Ref	Expression
moexexvw	⊢ ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦∃𝑥(𝜑 ∧ 𝜓))

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)

Proof of Theorem moexexvw

Step	Hyp	Ref	Expression
1		nfv 1913	. 2 ⊢ Ⅎ𝑦𝜑
2		nfv 1913	. 2 ⊢ Ⅎ𝑦∃*𝑥𝜑
3		nfe1 2151	. . 3 ⊢ Ⅎ𝑥∃𝑥(𝜑 ∧ 𝜓)
4	3	nfmov 2563	. 2 ⊢ Ⅎ𝑥∃*𝑦∃𝑥(𝜑 ∧ 𝜓)
5	1, 2, 4	moexexlem 2629	1 ⊢ ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦∃𝑥(𝜑 ∧ 𝜓))

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1535  ∃wex 1777  ∃*wmo 2541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-10 2141  ax-11 2158  ax-12 2178

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-mo 2543

This theorem is referenced by:  mosub  3735  funco  6618  tfsconcatlem  43298