Theorem moexexv 2664

Description: "At most one" double quantification. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker moexexvw 2653 when possible. (Contributed by NM, 26-Jan-1997.) (New usage is discouraged.)

Assertion

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

Distinct variable group:   𝜑,𝑦

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

Proof of Theorem moexexv

Step	Hyp	Ref	Expression
1		nfv 1946	. 2 ⊢ Ⅎ𝑦𝜑
2	1	moexex 2663	1 ⊢ ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦∃𝑥(𝜑 ∧ 𝜓))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567  ∃wex 1811  ∃*wmo 2562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-mo 2564

This theorem is used by: (None)