Theorem 2moswap 2640

Description: A condition allowing to swap an existential quantifier and at at-most-one quantifier. Usage of this theorem is discouraged because it depends on ax-13 2371. Use the weaker 2moswapv 2625 when possible. (Contributed by NM, 10-Apr-2004.) (New usage is discouraged.)

Assertion

Ref	Expression
2moswap	⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥𝜑))

Proof of Theorem 2moswap

Step	Hyp	Ref	Expression
1		nfe1 2147	. . . 4 ⊢ Ⅎ𝑦∃𝑦𝜑
2	1	moexex 2634	. . 3 ⊢ ((∃*𝑥∃𝑦𝜑 ∧ ∀𝑥∃*𝑦𝜑) → ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑))
3	2	expcom 414	. 2 ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑)))
4		19.8a 2174	. . . . 5 ⊢ (𝜑 → ∃𝑦𝜑)
5	4	pm4.71ri 561	. . . 4 ⊢ (𝜑 ↔ (∃𝑦𝜑 ∧ 𝜑))
6	5	exbii 1850	. . 3 ⊢ (∃𝑥𝜑 ↔ ∃𝑥(∃𝑦𝜑 ∧ 𝜑))
7	6	mobii 2542	. 2 ⊢ (∃*𝑦∃𝑥𝜑 ↔ ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑))
8	3, 7	syl6ibr 251	1 ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥𝜑))

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1539  ∃wex 1781  ∃*wmo 2532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2371

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-ex 1782  df-nf 1786  df-mo 2534

This theorem is referenced by:  2euswap  2641