Theorem cbvexv1 2373

Description: Rule used to change bound variables, using implicit substitution. Version of cbvex 2430 with a disjoint variable condition, which does not require ax-13 2403. See cbvexvw 2070 for a version with two disjoint variable conditions, requiring fewer axioms, and cbvexv 2432 for another variant. (Contributed by NM, 21-Jun-1993.) (Revised by BJ, 31-May-2019.)

Hypotheses

Ref	Expression
cbvalv1.nf1	⊢ Ⅎ𝑦𝜑
cbvalv1.nf2	⊢ Ⅎ𝑥𝜓
cbvalv1.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

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

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem cbvexv1

Step	Hyp	Ref	Expression
1		cbvalv1.nf1	. . . . 5 ⊢ Ⅎ𝑦𝜑
2	1	nfn 1890	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜑
3		cbvalv1.nf2	. . . . 5 ⊢ Ⅎ𝑥𝜓
4	3	nfn 1890	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
5		cbvalv1.1	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
6	5	notbid 321	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓))
7	2, 4, 6	cbvalv1 2372	. . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ∀𝑦 ¬ 𝜓)
8		alnex 1814	. . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
9		alnex 1814	. . 3 ⊢ (∀𝑦 ¬ 𝜓 ↔ ¬ ∃𝑦𝜓)
10	7, 8, 9	3bitr3i 304	. 2 ⊢ (¬ ∃𝑥𝜑 ↔ ¬ ∃𝑦𝜓)
11	10	con4bii 324	1 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀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-11 2194  ax-12 2215

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:  sb8ef  2386  exsb  2390  mof  2590  euf  2603  cbveuw  2633  eqvincf  3607  rexab2  3660  euabsn  4690  eluniab  4884  cbvopab1  5183  cbvopab1g  5184  cbvopab2  5185  cbvopab1s  5186  axrep1  5237  axrep2  5239  axrep4OLD  5243  opeliunxp  5726  opeliun2xp  5727  dfdmf  5884  dfrnf  5938  elrnmpt1  5948  cbvoprab1  7503  cbvoprab2  7504  opabex3d  7965  opabex3rd  7966  opabex3  7967  zfcndrep  10626  fsum2dlem  15858  fprod2dlem  16071  2ndresdju  33124  bnj1146  35302  bnj607  35427  bnj1228  35522  fineqvrep  35642  poimirlem26  38397  sbcexf  38865  elunif  45852  stoweidlem46  46876