Metamath Proof Explorer


Theorem hbalw

Description: Weak version of hbal . Uses only Tarski's FOL axiom schemes. Unlike hbal , this theorem requires that x and y be distinct, i.e., not be bundled. (Contributed by NM, 19-Apr-2017)

Ref Expression
Hypotheses hbalw.1 x=zφψ
hbalw.2 φxφ
Assertion hbalw yφxyφ

Proof

Step Hyp Ref Expression
1 hbalw.1 x=zφψ
2 hbalw.2 φxφ
3 2 alimi yφyxφ
4 1 alcomiw yxφxyφ
5 3 4 syl yφxyφ