Metamath Proof Explorer


Theorem sbiedw

Description: Conversion of implicit substitution to explicit substitution (deduction version of sbiev ). Version of sbied with a disjoint variable condition, requiring fewer axioms. (Contributed by NM, 30-Jun-1994) (Revised by Gino Giotto, 10-Jan-2024) Avoid ax-10 . (Revised by Wolf Lammen, 28-Jan-2024)

Ref Expression
Hypotheses sbiedw.1 𝑥 𝜑
sbiedw.2 ( 𝜑 → Ⅎ 𝑥 𝜒 )
sbiedw.3 ( 𝜑 → ( 𝑥 = 𝑦 → ( 𝜓𝜒 ) ) )
Assertion sbiedw ( 𝜑 → ( [ 𝑦 / 𝑥 ] 𝜓𝜒 ) )

Proof

Step Hyp Ref Expression
1 sbiedw.1 𝑥 𝜑
2 sbiedw.2 ( 𝜑 → Ⅎ 𝑥 𝜒 )
3 sbiedw.3 ( 𝜑 → ( 𝑥 = 𝑦 → ( 𝜓𝜒 ) ) )
4 1 sbrimv ( [ 𝑦 / 𝑥 ] ( 𝜑𝜓 ) ↔ ( 𝜑 → [ 𝑦 / 𝑥 ] 𝜓 ) )
5 1 2 nfim1 𝑥 ( 𝜑𝜒 )
6 3 com12 ( 𝑥 = 𝑦 → ( 𝜑 → ( 𝜓𝜒 ) ) )
7 6 pm5.74d ( 𝑥 = 𝑦 → ( ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) ) )
8 5 7 sbiev ( [ 𝑦 / 𝑥 ] ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) )
9 4 8 bitr3i ( ( 𝜑 → [ 𝑦 / 𝑥 ] 𝜓 ) ↔ ( 𝜑𝜒 ) )
10 9 pm5.74ri ( 𝜑 → ( [ 𝑦 / 𝑥 ] 𝜓𝜒 ) )