Theorem bj-cbvex4vv 37468

Description: Version of cbvex4v 2446 with a disjoint variable condition, which does not require ax-13 2403. (Contributed by BJ, 16-Jun-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-cbvex4vv.1	⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑢) → (𝜑 ↔ 𝜓))
bj-cbvex4vv.2	⊢ ((𝑧 = 𝑓 ∧ 𝑤 = 𝑔) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
bj-cbvex4vv	⊢ (∃𝑥∃𝑦∃𝑧∃𝑤𝜑 ↔ ∃𝑣∃𝑢∃𝑓∃𝑔𝜒)

Distinct variable groups:   𝑧,𝑤,𝜒   𝑣,𝑢,𝜑   𝑥,𝑦,𝜓   𝑓,𝑔,𝜓   𝑧,𝑓,𝑔,𝑤   𝑤,𝑢,𝑥,𝑦,𝑧,𝑣

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑓, 𝑔)   𝜓(𝑧, 𝑤, 𝑣, 𝑢)   𝜒(𝑥, 𝑦, 𝑣, 𝑢, 𝑓, 𝑔)

Proof of Theorem bj-cbvex4vv

Step	Hyp	Ref	Expression
1		bj-cbvex4vv.1	. . . 4 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑢) → (𝜑 ↔ 𝜓))
2	1	2exbidv 1953	. . 3 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = 𝑢) → (∃𝑧∃𝑤𝜑 ↔ ∃𝑧∃𝑤𝜓))
3	2	cbvex2vw 2070	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤𝜑 ↔ ∃𝑣∃𝑢∃𝑧∃𝑤𝜓)
4		bj-cbvex4vv.2	. . . 4 ⊢ ((𝑧 = 𝑓 ∧ 𝑤 = 𝑔) → (𝜓 ↔ 𝜒))
5	4	cbvex2vw 2070	. . 3 ⊢ (∃𝑧∃𝑤𝜓 ↔ ∃𝑓∃𝑔𝜒)
6	5	2exbii 1878	. 2 ⊢ (∃𝑣∃𝑢∃𝑧∃𝑤𝜓 ↔ ∃𝑣∃𝑢∃𝑓∃𝑔𝜒)
7	3, 6	bitri 278	1 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤𝜑 ↔ ∃𝑣∃𝑢∃𝑓∃𝑔𝜒)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400  ∃wex 1808

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809

This theorem is used by: (None)