Theorem cbvexv1 2347

Description: Rule used to change bound variables, using implicit substitution. Version of cbvex 2404 with a disjoint variable condition, which does not require ax-13 2377. See cbvexvw 2039 for a version with two disjoint variable conditions, requiring fewer axioms, and cbvexv 2406 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 1859	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜑
3		cbvalv1.nf2	. . . . 5 ⊢ Ⅎ𝑥𝜓
4	3	nfn 1859	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
5		cbvalv1.1	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
6	5	notbid 318	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓))
7	2, 4, 6	cbvalv1 2346	. . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ∀𝑦 ¬ 𝜓)
8		alnex 1783	. . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
9		alnex 1783	. . 3 ⊢ (∀𝑦 ¬ 𝜓 ↔ ¬ ∃𝑦𝜓)
10	7, 8, 9	3bitr3i 301	. 2 ⊢ (¬ ∃𝑥𝜑 ↔ ¬ ∃𝑦𝜓)
11	10	con4bii 321	1 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206  ∀wal 1540  ∃wex 1781  Ⅎwnf 1785

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-11 2163  ax-12 2185

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ex 1782  df-nf 1786

This theorem is referenced by:  sb8ef  2360  exsb  2364  mof  2564  euf  2577  cbveuw  2607  eqvincf  3606  rexab2  3659  euabsn  4685  eluniab  4879  cbvopab1  5174  cbvopab1g  5175  cbvopab2  5176  cbvopab1s  5177  axrep1  5227  axrep2  5229  axrep4OLD  5233  opeliunxp  5699  opeliun2xp  5700  dfdmf  5853  dfrnf  5907  elrnmpt1  5917  cbvoprab1  7455  cbvoprab2  7456  opabex3d  7919  opabex3rd  7920  opabex3  7921  zfcndrep  10537  fsum2dlem  15705  fprod2dlem  15915  2ndresdju  32738  bnj1146  34966  bnj607  35091  bnj1228  35186  fineqvrep  35289  poimirlem26  37886  sbcexf  38355  elunif  45365  stoweidlem46  46393