Metamath Proof Explorer


Theorem bj-ceqsaltv

Description: Version of bj-ceqsalt with a disjoint variable condition on x , V , removing dependency on df-sb and df-clab . Prefer its use over bj-ceqsalt when sufficient (in particular when V is substituted for _V ). (Contributed by BJ, 16-Jun-2019) (Proof modification is discouraged.)

Ref Expression
Assertion bj-ceqsaltv ( ( Ⅎ 𝑥 𝜓 ∧ ∀ 𝑥 ( 𝑥 = 𝐴 → ( 𝜑𝜓 ) ) ∧ 𝐴𝑉 ) → ( ∀ 𝑥 ( 𝑥 = 𝐴𝜑 ) ↔ 𝜓 ) )

Proof

Step Hyp Ref Expression
1 elissetv ( 𝐴𝑉 → ∃ 𝑥 𝑥 = 𝐴 )
2 1 3anim3i ( ( Ⅎ 𝑥 𝜓 ∧ ∀ 𝑥 ( 𝑥 = 𝐴 → ( 𝜑𝜓 ) ) ∧ 𝐴𝑉 ) → ( Ⅎ 𝑥 𝜓 ∧ ∀ 𝑥 ( 𝑥 = 𝐴 → ( 𝜑𝜓 ) ) ∧ ∃ 𝑥 𝑥 = 𝐴 ) )
3 bj-ceqsalt0 ( ( Ⅎ 𝑥 𝜓 ∧ ∀ 𝑥 ( 𝑥 = 𝐴 → ( 𝜑𝜓 ) ) ∧ ∃ 𝑥 𝑥 = 𝐴 ) → ( ∀ 𝑥 ( 𝑥 = 𝐴𝜑 ) ↔ 𝜓 ) )
4 2 3 syl ( ( Ⅎ 𝑥 𝜓 ∧ ∀ 𝑥 ( 𝑥 = 𝐴 → ( 𝜑𝜓 ) ) ∧ 𝐴𝑉 ) → ( ∀ 𝑥 ( 𝑥 = 𝐴𝜑 ) ↔ 𝜓 ) )