Metamath Proof Explorer


Theorem sbceq1ddi

Description: A lemma for eliminating inequality, in inference form. (Contributed by Giovanni Mascellani, 31-May-2019)

Ref Expression
Hypotheses sbceq1ddi.1 ⊢ φ → A = B
sbceq1ddi.2 ⊢ ψ → θ
sbceq1ddi.3 ⊢ [˙A / x]˙ χ ↔ θ
sbceq1ddi.4 ⊢ [˙B / x]˙ χ ↔ η
Assertion sbceq1ddi ⊢ φ ∧ ψ → η

Proof

Step Hyp Ref Expression
1 sbceq1ddi.1 ⊢ φ → A = B
2 sbceq1ddi.2 ⊢ ψ → θ
3 sbceq1ddi.3 ⊢ [˙A / x]˙ χ ↔ θ
4 sbceq1ddi.4 ⊢ [˙B / x]˙ χ ↔ η
5 1 adantr ⊢ φ ∧ ψ → A = B
6 2 3 sylibr ⊢ ψ → [˙A / x]˙ χ
7 6 adantl ⊢ φ ∧ ψ → [˙A / x]˙ χ
8 5 7 sbceq1dd ⊢ φ ∧ ψ → [˙B / x]˙ χ
9 8 4 sylib ⊢ φ ∧ ψ → η