Theorem cbvex2v 2374

Description: Rule used to change bound variables, using implicit substitution. Version of cbvex2 2442 with a disjoint variable condition, which does not require ax-13 2402. (Contributed by NM, 14-Sep-2003.) (Revised by BJ, 16-Jun-2019.)

Hypotheses

Ref	Expression
cbval2v.1	⊢ Ⅎ𝑧𝜑
cbval2v.2	⊢ Ⅎ𝑤𝜑
cbval2v.3	⊢ Ⅎ𝑥𝜓
cbval2v.4	⊢ Ⅎ𝑦𝜓
cbval2v.5	⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvex2v	⊢ (∃𝑥∃𝑦𝜑 ↔ ∃𝑧∃𝑤𝜓)

Distinct variable group:   𝑥,𝑦,𝑧,𝑤

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

Proof of Theorem cbvex2v

Step	Hyp	Ref	Expression
1		cbval2v.1	. . . . 5 ⊢ Ⅎ𝑧𝜑
2	1	nfn 1876	. . . 4 ⊢ Ⅎ𝑧 ¬ 𝜑
3		cbval2v.2	. . . . 5 ⊢ Ⅎ𝑤𝜑
4	3	nfn 1876	. . . 4 ⊢ Ⅎ𝑤 ¬ 𝜑
5		cbval2v.3	. . . . 5 ⊢ Ⅎ𝑥𝜓
6	5	nfn 1876	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
7		cbval2v.4	. . . . 5 ⊢ Ⅎ𝑦𝜓
8	7	nfn 1876	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜓
9		cbval2v.5	. . . . 5 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝜑 ↔ 𝜓))
10	9	notbid 320	. . . 4 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (¬ 𝜑 ↔ ¬ 𝜓))
11	2, 4, 6, 8, 10	cbval2v 2373	. . 3 ⊢ (∀𝑥∀𝑦 ¬ 𝜑 ↔ ∀𝑧∀𝑤 ¬ 𝜓)
12		2nexaln 1849	. . 3 ⊢ (¬ ∃𝑥∃𝑦𝜑 ↔ ∀𝑥∀𝑦 ¬ 𝜑)
13		2nexaln 1849	. . 3 ⊢ (¬ ∃𝑧∃𝑤𝜓 ↔ ∀𝑧∀𝑤 ¬ 𝜓)
14	11, 12, 13	3bitr4i 305	. 2 ⊢ (¬ ∃𝑥∃𝑦𝜑 ↔ ¬ ∃𝑧∃𝑤𝜓)
15	14	con4bii 323	1 ⊢ (∃𝑥∃𝑦𝜑 ↔ ∃𝑧∃𝑤𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399  ∀wal 1557  ∃wex 1798  Ⅎwnf 1802

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-10 2174  ax-11 2190  ax-12 2211

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

This theorem is referenced by:  cbvopab  5171  cbvoprab12  7481  bj-cbvex2vv  37251  or2expropbilem2  47591  ichnreuop  48042