Theorem moexexvw 2657

Description: "At most one" double quantification. Version of moexexv 2668 with an additional disjoint variable condition, which does not require ax-13 2405. (Contributed by NM, 26-Jan-1997.) (Revised by GG, 22-Aug-2023.) Factor out common proof lines with moexex 2667. (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 1936	. 2 ⊢ Ⅎ𝑦𝜑
2		nfv 1936	. 2 ⊢ Ⅎ𝑦∃*𝑥𝜑
3		nfe1 2186	. . 3 ⊢ Ⅎ𝑥∃𝑥(𝜑 ∧ 𝜓)
4	3	nfmov 2589	. 2 ⊢ Ⅎ𝑥∃*𝑦∃𝑥(𝜑 ∧ 𝜓)
5	1, 2, 4	moexexlem 2655	1 ⊢ ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦∃𝑥(𝜑 ∧ 𝜓))

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1560  ∃wex 1801  ∃*wmo 2566

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-10 2177  ax-11 2193  ax-12 2214

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-ex 1802  df-nf 1806  df-mo 2568

This theorem is referenced by:  mosub  3678  funco  6563  tfsconcatlem  43918