Theorem 2moswap 2706

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 2379. Use the weaker 2moswapv 2691 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 2151	. . . 4 ⊢ Ⅎ𝑦∃𝑦𝜑
2	1	moexex 2700	. . 3 ⊢ ((∃*𝑥∃𝑦𝜑 ∧ ∀𝑥∃*𝑦𝜑) → ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑))
3	2	expcom 417	. 2 ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑)))
4		19.8a 2178	. . . . 5 ⊢ (𝜑 → ∃𝑦𝜑)
5	4	pm4.71ri 564	. . . 4 ⊢ (𝜑 ↔ (∃𝑦𝜑 ∧ 𝜑))
6	5	exbii 1849	. . 3 ⊢ (∃𝑥𝜑 ↔ ∃𝑥(∃𝑦𝜑 ∧ 𝜑))
7	6	mobii 2606	. 2 ⊢ (∃*𝑦∃𝑥𝜑 ↔ ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑))
8	3, 7	syl6ibr 255	1 ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥𝜑))

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536  ∃wex 1781  ∃*wmo 2596

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 1911  ax-6 1970  ax-7 2015  ax-10 2142  ax-11 2158  ax-12 2175  ax-13 2379

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598

This theorem is referenced by:  2euswap  2707