Theorem exdistrf 2481

Description: Distribution of existential quantifiers, with a bound-variable hypothesis saying that 𝑦 is not free in 𝜑, but 𝑥 can be free in 𝜑 (and there is no distinct variable condition on 𝑥 and 𝑦). (Contributed by Mario Carneiro, 20-Mar-2013.) (Proof shortened by Wolf Lammen, 14-May-2018.) Usage of this theorem is discouraged because it depends on ax-13 2406. Use exdistr 1987 instead. (New usage is discouraged.)

Hypothesis

Ref	Expression
exdistrf.1	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑)

Assertion

Ref	Expression
exdistrf	⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))

Proof of Theorem exdistrf

Step	Hyp	Ref	Expression
1		nfe1 2188	. 2 ⊢ Ⅎ𝑥∃𝑥(𝜑 ∧ ∃𝑦𝜓)
2		19.8a 2220	. . . . . 6 ⊢ (𝜓 → ∃𝑦𝜓)
3	2	anim2i 629	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝜑 ∧ ∃𝑦𝜓))
4	3	eximi 1868	. . . 4 ⊢ (∃𝑦(𝜑 ∧ 𝜓) → ∃𝑦(𝜑 ∧ ∃𝑦𝜓))
5		biidd 265	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝜑 ∧ ∃𝑦𝜓) ↔ (𝜑 ∧ ∃𝑦𝜓)))
6	5	drex1 2475	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝜑 ∧ ∃𝑦𝜓) ↔ ∃𝑦(𝜑 ∧ ∃𝑦𝜓)))
7	4, 6	imbitrrid 249	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑦(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓)))
8		19.40 1919	. . . 4 ⊢ (∃𝑦(𝜑 ∧ 𝜓) → (∃𝑦𝜑 ∧ ∃𝑦𝜓))
9		exdistrf.1	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑)
10	9	19.9d 2242	. . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑦𝜑 → 𝜑))
11	10	anim1d 623	. . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ((∃𝑦𝜑 ∧ ∃𝑦𝜓) → (𝜑 ∧ ∃𝑦𝜓)))
12		19.8a 2220	. . . 4 ⊢ ((𝜑 ∧ ∃𝑦𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
13	8, 11, 12	syl56 37	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑦(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓)))
14	7, 13	pm2.61i 184	. 2 ⊢ (∃𝑦(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
15	1, 14	exlimi 2256	1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-12 2216  ax-13 2406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817

This theorem is used by:  oprabid  7448