Metamath Proof Explorer


Theorem sbiedvw

Description: Conversion of implicit substitution to explicit substitution (deduction version of sbievw ). Version of sbied and sbiedv with more disjoint variable conditions, requiring fewer axioms. (Contributed by NM, 30-Jun-1994) (Revised by Gino Giotto, 29-Jan-2024)

Ref Expression
Hypothesis sbiedvw.1 ( ( 𝜑𝑥 = 𝑦 ) → ( 𝜓𝜒 ) )
Assertion sbiedvw ( 𝜑 → ( [ 𝑦 / 𝑥 ] 𝜓𝜒 ) )

Proof

Step Hyp Ref Expression
1 sbiedvw.1 ( ( 𝜑𝑥 = 𝑦 ) → ( 𝜓𝜒 ) )
2 sbrimvw ( [ 𝑦 / 𝑥 ] ( 𝜑𝜓 ) ↔ ( 𝜑 → [ 𝑦 / 𝑥 ] 𝜓 ) )
3 1 expcom ( 𝑥 = 𝑦 → ( 𝜑 → ( 𝜓𝜒 ) ) )
4 3 pm5.74d ( 𝑥 = 𝑦 → ( ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) ) )
5 4 sbievw ( [ 𝑦 / 𝑥 ] ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) )
6 2 5 bitr3i ( ( 𝜑 → [ 𝑦 / 𝑥 ] 𝜓 ) ↔ ( 𝜑𝜒 ) )
7 6 pm5.74ri ( 𝜑 → ( [ 𝑦 / 𝑥 ] 𝜓𝜒 ) )