Theorem ceqsal 2768

Description: A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.)

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.2	. 2 ⊢ 𝐴 ∈ V
2		ceqsal.1	. . 3 ⊢ Ⅎ𝑥𝜓
3		ceqsal.3	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
4	2, 3	ceqsalg 2767	. 2 ⊢ (𝐴 ∈ V → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓))
5	1, 4	ax-mp 5	1 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓)

Syntax hints:   → wi 4   ↔ wb 105  ∀wal 1351   = wceq 1353  Ⅎwnf 1460   ∈ wcel 2148  Vcvv 2739

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-v 2741

This theorem is referenced by:  ceqsalv  2769