Theorem bj-ceqsalgv 37554

Description: Version of bj-ceqsalg 37552 with a disjoint variable condition on 𝑥, 𝑉, removing dependency on df-sb 2096 and df-clab 2741. Prefer its use over bj-ceqsalg 37552 when sufficient (in particular when 𝑉 is substituted for V). (Contributed by BJ, 12-Oct-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-ceqsalgv.1	⊢ Ⅎ𝑥𝜓
bj-ceqsalgv.2	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
bj-ceqsalgv	⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑉

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

Proof of Theorem bj-ceqsalgv

Step	Hyp	Ref	Expression
1		elissetv 2843	. 2 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴)
2		bj-ceqsalgv.1	. . 3 ⊢ Ⅎ𝑥𝜓
3		bj-ceqsalgv.2	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
4	2, 3	bj-ceqsalg0 37551	. 2 ⊢ (∃𝑥 𝑥 = 𝐴 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓))
5	1, 4	syl 18	1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   = wceq 1569  ∃wex 1808  Ⅎwnf 1812   ∈ wcel 2142

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  ax-8 2144  ax-12 2212

This proof depends on definitions:  df-bi 210  df-an 401  df-3an 1104  df-ex 1809  df-nf 1813  df-clel 2837

This theorem is used by:  bj-ceqsal  37556