Theorem e2ebindVD 42532

Description: The following User's Proof is a Virtual Deduction proof (see wvd1 42189) completed automatically by a Metamath tools program invoking mmj2 and the Metamath Proof Assistant. e2ebind 42183 is e2ebindVD 42532 without virtual deductions and was automatically derived from e2ebindVD 42532.

1::	⊢ (𝜑 ↔ 𝜑)
2:1:	⊢ (∀𝑦𝑦 = 𝑥 → (𝜑 ↔ 𝜑))
3:2:	⊢ (∀𝑦𝑦 = 𝑥 → (∃𝑦𝜑 ↔ ∃𝑥𝜑 ))
4::	⊢ (   ∀𝑦𝑦 = 𝑥   ▶   ∀𝑦𝑦 = 𝑥   )
5:3,4:	⊢ (   ∀𝑦𝑦 = 𝑥   ▶   (∃𝑦𝜑 ↔ ∃𝑥 𝜑)   )
6::	⊢ (∀𝑦𝑦 = 𝑥 → ∀𝑦∀𝑦𝑦 = 𝑥)
7:5,6:	⊢ (   ∀𝑦𝑦 = 𝑥   ▶   ∀𝑦(∃𝑦𝜑 ↔ ∃𝑥𝜑)   )
8:7:	⊢ (   ∀𝑦𝑦 = 𝑥   ▶   (∃𝑦∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑)   )
9::	⊢ (∃𝑦∃𝑥𝜑 ↔ ∃𝑥∃𝑦𝜑)
10:8,9:	⊢ (   ∀𝑦𝑦 = 𝑥   ▶   (∃𝑦∃𝑦𝜑 ↔ ∃𝑥∃𝑦𝜑)   )
11::	⊢ (∃𝑦𝜑 → ∀𝑦∃𝑦𝜑)
12:11:	⊢ (∃𝑦∃𝑦𝜑 ↔ ∃𝑦𝜑)
13:10,12:	⊢ (   ∀𝑦𝑦 = 𝑥   ▶   (∃𝑥∃𝑦𝜑 ↔ ∃𝑦𝜑)   )
14:13:	⊢ (∀𝑦𝑦 = 𝑥 → (∃𝑥∃𝑦𝜑 ↔ ∃ 𝑦𝜑))
15::	⊢ (∀𝑦𝑦 = 𝑥 ↔ ∀𝑥𝑥 = 𝑦)
qed:14,15:	⊢ (∀𝑥𝑥 = 𝑦 → (∃𝑥∃𝑦𝜑 ↔ ∃ 𝑦𝜑))

(Contributed by Alan Sare, 27-Nov-2014.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
e2ebindVD	⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥∃𝑦𝜑 ↔ ∃𝑦𝜑))

Proof of Theorem e2ebindVD

Step	Hyp	Ref	Expression
1		axc11n 2426	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥)
2		hba1 2290	. . . . . . 7 ⊢ (∀𝑦 𝑦 = 𝑥 → ∀𝑦∀𝑦 𝑦 = 𝑥)
3		idn1 42194	. . . . . . . 8 ⊢ (   ∀𝑦 𝑦 = 𝑥   ▶   ∀𝑦 𝑦 = 𝑥   )
4		biid 260	. . . . . . . . . 10 ⊢ (𝜑 ↔ 𝜑)
5	4	a1i 11	. . . . . . . . 9 ⊢ (∀𝑦 𝑦 = 𝑥 → (𝜑 ↔ 𝜑))
6	5	drex1 2441	. . . . . . . 8 ⊢ (∀𝑦 𝑦 = 𝑥 → (∃𝑦𝜑 ↔ ∃𝑥𝜑))
7	3, 6	e1a 42247	. . . . . . 7 ⊢ (   ∀𝑦 𝑦 = 𝑥   ▶   (∃𝑦𝜑 ↔ ∃𝑥𝜑)   )
8	2, 7	gen11nv 42237	. . . . . 6 ⊢ (   ∀𝑦 𝑦 = 𝑥   ▶   ∀𝑦(∃𝑦𝜑 ↔ ∃𝑥𝜑)   )
9		exbi 1849	. . . . . 6 ⊢ (∀𝑦(∃𝑦𝜑 ↔ ∃𝑥𝜑) → (∃𝑦∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑))
10	8, 9	e1a 42247	. . . . 5 ⊢ (   ∀𝑦 𝑦 = 𝑥   ▶   (∃𝑦∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑)   )
11		excom 2162	. . . . 5 ⊢ (∃𝑦∃𝑥𝜑 ↔ ∃𝑥∃𝑦𝜑)
12		bibi1 352	. . . . . 6 ⊢ ((∃𝑦∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑) → ((∃𝑦∃𝑦𝜑 ↔ ∃𝑥∃𝑦𝜑) ↔ (∃𝑦∃𝑥𝜑 ↔ ∃𝑥∃𝑦𝜑)))
13	12	biimprd 247	. . . . 5 ⊢ ((∃𝑦∃𝑦𝜑 ↔ ∃𝑦∃𝑥𝜑) → ((∃𝑦∃𝑥𝜑 ↔ ∃𝑥∃𝑦𝜑) → (∃𝑦∃𝑦𝜑 ↔ ∃𝑥∃𝑦𝜑)))
14	10, 11, 13	e10 42314	. . . 4 ⊢ (   ∀𝑦 𝑦 = 𝑥   ▶   (∃𝑦∃𝑦𝜑 ↔ ∃𝑥∃𝑦𝜑)   )
15		nfe1 2147	. . . . 5 ⊢ Ⅎ𝑦∃𝑦𝜑
16	15	19.9 2198	. . . 4 ⊢ (∃𝑦∃𝑦𝜑 ↔ ∃𝑦𝜑)
17		bitr3 353	. . . 4 ⊢ ((∃𝑦∃𝑦𝜑 ↔ ∃𝑥∃𝑦𝜑) → ((∃𝑦∃𝑦𝜑 ↔ ∃𝑦𝜑) → (∃𝑥∃𝑦𝜑 ↔ ∃𝑦𝜑)))
18	14, 16, 17	e10 42314	. . 3 ⊢ (   ∀𝑦 𝑦 = 𝑥   ▶   (∃𝑥∃𝑦𝜑 ↔ ∃𝑦𝜑)   )
19	18	in1 42191	. 2 ⊢ (∀𝑦 𝑦 = 𝑥 → (∃𝑥∃𝑦𝜑 ↔ ∃𝑦𝜑))
20	1, 19	syl 17	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥∃𝑦𝜑 ↔ ∃𝑦𝜑))

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1537   = wceq 1539  ∃wex 1782

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

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-ex 1783  df-nf 1787  df-vd1 42190

This theorem is referenced by: (None)