Theorem ceqsal 3487

Description: A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.) Avoid df-clab 2739. (Revised by Wolf Lammen, 23-Jan-2025.)

Hypotheses

Ref	Expression
ceqsal.1	⊢ Ⅎ𝑥𝜓
ceqsal.2	⊢ 𝐴 ∈ V
ceqsal.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
ceqsal	⊢ (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓)

Distinct variable group:   𝑥,𝐴

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

Proof of Theorem ceqsal

Step	Hyp	Ref	Expression
1		ceqsal.1	. . 3 ⊢ Ⅎ𝑥𝜓
2	1	19.23 2247	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝜓) ↔ (∃𝑥 𝑥 = 𝐴 → 𝜓))
3		ceqsal.3	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
4	3	pm5.74i 274	. . 3 ⊢ ((𝑥 = 𝐴 → 𝜑) ↔ (𝑥 = 𝐴 → 𝜓))
5	4	albii 1851	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ ∀𝑥(𝑥 = 𝐴 → 𝜓))
6		ceqsal.2	. . . 4 ⊢ 𝐴 ∈ V
7	6	isseti 3468	. . 3 ⊢ ∃𝑥 𝑥 = 𝐴
8	7	a1bi 365	. 2 ⊢ (𝜓 ↔ (∃𝑥 𝑥 = 𝐴 → 𝜓))
9	2, 5, 8	3bitr4i 306	1 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   = wceq 1569  ∃wex 1811  Ⅎwnf 1815   ∈ wcel 2144  Vcvv 3450

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-12 2212

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-nf 1816  df-clel 2835

This theorem is used by:  ceqsex  3497  ralxp3f  8154  aomclem6  44061