Theorem cbvexd 2439

Description: Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 2482. Usage of this theorem is discouraged because it depends on ax-13 2403. Use the weaker cbvexdw 2370 if possible. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbvald.1	⊢ Ⅎ𝑦𝜑
cbvald.2	⊢ (𝜑 → Ⅎ𝑦𝜓)
cbvald.3	⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))

Assertion

Ref	Expression
cbvexd	⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑦𝜒))

Distinct variable groups:   𝜑,𝑥   𝜒,𝑥

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

Proof of Theorem cbvexd

Step	Hyp	Ref	Expression
1		cbvald.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2		cbvald.2	. . . . 5 ⊢ (𝜑 → Ⅎ𝑦𝜓)
3	2	nfnd 1878	. . . 4 ⊢ (𝜑 → Ⅎ𝑦 ¬ 𝜓)
4		cbvald.3	. . . . 5 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
5		notbi 321	. . . . 5 ⊢ ((𝜓 ↔ 𝜒) ↔ (¬ 𝜓 ↔ ¬ 𝜒))
6	4, 5	imbitrdi 253	. . . 4 ⊢ (𝜑 → (𝑥 = 𝑦 → (¬ 𝜓 ↔ ¬ 𝜒)))
7	1, 3, 6	cbvald 2438	. . 3 ⊢ (𝜑 → (∀𝑥 ¬ 𝜓 ↔ ∀𝑦 ¬ 𝜒))
8		alnex 1801	. . 3 ⊢ (∀𝑥 ¬ 𝜓 ↔ ¬ ∃𝑥𝜓)
9		alnex 1801	. . 3 ⊢ (∀𝑦 ¬ 𝜒 ↔ ¬ ∃𝑦𝜒)
10	7, 8, 9	3bitr3g 315	. 2 ⊢ (𝜑 → (¬ ∃𝑥𝜓 ↔ ¬ ∃𝑦𝜒))
11	10	con4bid 319	1 ⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑦𝜒))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208  ∀wal 1558  ∃wex 1799  Ⅎwnf 1803

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-11 2191  ax-12 2212  ax-13 2403

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-ex 1800  df-nf 1804

This theorem is referenced by:  cbvexdva  2441  dfid3  5545  axrepndlem2  10551  axunnd  10554  axpowndlem2  10556  axpownd  10559  axregndlem2  10561  axinfndlem1  10563  axacndlem4  10568  wl-mo2df  38073  wl-eudf  38075