Theorem cbvexh 1638

Description: Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Feb-2015.)

Hypotheses

Ref	Expression
cbvexh.1	⊢ (𝜑 → ∀𝑦𝜑)
cbvexh.2	⊢ (𝜓 → ∀𝑥𝜓)
cbvexh.3	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvexh	⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)

Proof of Theorem cbvexh

Step	Hyp	Ref	Expression
1		cbvexh.2	. . . 4 ⊢ (𝜓 → ∀𝑥𝜓)
2	1	hbex 1527	. . 3 ⊢ (∃𝑦𝜓 → ∀𝑥∃𝑦𝜓)
3		cbvexh.1	. . . . 5 ⊢ (𝜑 → ∀𝑦𝜑)
4		cbvexh.3	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
5	4	bicomd 129	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜑))
6	5	equcoms 1594	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝜓 ↔ 𝜑))
7	3, 6	equsex 1616	. . . 4 ⊢ (∃𝑦(𝑦 = 𝑥 ∧ 𝜓) ↔ 𝜑)
8		simpr 103	. . . . 5 ⊢ ((𝑦 = 𝑥 ∧ 𝜓) → 𝜓)
9	8	eximi 1491	. . . 4 ⊢ (∃𝑦(𝑦 = 𝑥 ∧ 𝜓) → ∃𝑦𝜓)
10	7, 9	sylbir 125	. . 3 ⊢ (𝜑 → ∃𝑦𝜓)
11	2, 10	exlimih 1484	. 2 ⊢ (∃𝑥𝜑 → ∃𝑦𝜓)
12	3	hbex 1527	. . 3 ⊢ (∃𝑥𝜑 → ∀𝑦∃𝑥𝜑)
13	1, 4	equsex 1616	. . . 4 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ 𝜓)
14		simpr 103	. . . . 5 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → 𝜑)
15	14	eximi 1491	. . . 4 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∃𝑥𝜑)
16	13, 15	sylbir 125	. . 3 ⊢ (𝜓 → ∃𝑥𝜑)
17	12, 16	exlimih 1484	. 2 ⊢ (∃𝑦𝜓 → ∃𝑥𝜑)
18	11, 17	impbii 117	1 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98  ∀wal 1241   = wceq 1243  ∃wex 1381

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427

This theorem depends on definitions:  df-bi 110

This theorem is referenced by:  cbvex  1639  sb8eh  1735  cbvexv  1795  euf  1905  mopick  1978