Theorem cbvexv1 2350

Description: Rule used to change bound variables, using implicit substitution. Version of cbvex 2407 with a disjoint variable condition, which does not require ax-13 2380. See cbvexvw 2044 for a version with two disjoint variable conditions, requiring fewer axioms, and cbvexv 2409 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 1864	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜑
3		cbvalv1.nf2	. . . . 5 ⊢ Ⅎ𝑥𝜓
4	3	nfn 1864	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
5		cbvalv1.1	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
6	5	notbid 319	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓))
7	2, 4, 6	cbvalv1 2349	. . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ∀𝑦 ¬ 𝜓)
8		alnex 1788	. . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
9		alnex 1788	. . 3 ⊢ (∀𝑦 ¬ 𝜓 ↔ ¬ ∃𝑦𝜓)
10	7, 8, 9	3bitr3i 302	. 2 ⊢ (¬ ∃𝑥𝜑 ↔ ¬ ∃𝑦𝜓)
11	10	con4bii 322	1 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207  ∀wal 1545  ∃wex 1786  Ⅎwnf 1790

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-11 2168  ax-12 2189

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-ex 1787  df-nf 1791

This theorem is referenced by:  sb8ef  2363  exsb  2367  mof  2567  euf  2580  cbveuw  2610  eqvincf  3595  rexab2  3647  euabsn  4665  eluniab  4859  cbvopab1  5153  cbvopab1g  5154  cbvopab2  5155  cbvopab1s  5156  axrep1  5207  axrep2  5209  axrep4OLD  5213  opeliunxp  5692  opeliun2xp  5693  dfdmf  5845  dfrnf  5899  elrnmpt1  5909  cbvoprab1  7450  cbvoprab2  7451  opabex3d  7914  opabex3rd  7915  opabex3  7916  zfcndrep  10535  fsum2dlem  15730  fprod2dlem  15943  2ndresdju  32748  bnj1146  34980  bnj607  35105  bnj1228  35200  fineqvrep  35305  poimirlem26  38014  sbcexf  38483  elunif  45465  stoweidlem46  46490