Metamath Proof Explorer


Theorem hbn1fw

Description: Weak version of ax-10 from which we can prove any ax-10 instance not involving wff variables or bundling. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 19-Apr-2017) (Proof shortened by Wolf Lammen, 28-Feb-2018)

Ref Expression
Hypotheses hbn1fw.1 xφyxφ
hbn1fw.2 ¬ψx¬ψ
hbn1fw.3 yψxyψ
hbn1fw.4 ¬φy¬φ
hbn1fw.5 ¬yψx¬yψ
hbn1fw.6 x=yφψ
Assertion hbn1fw ¬xφx¬xφ

Proof

Step Hyp Ref Expression
1 hbn1fw.1 xφyxφ
2 hbn1fw.2 ¬ψx¬ψ
3 hbn1fw.3 yψxyψ
4 hbn1fw.4 ¬φy¬φ
5 hbn1fw.5 ¬yψx¬yψ
6 hbn1fw.6 x=yφψ
7 1 2 3 4 6 cbvalw xφyψ
8 7 notbii ¬xφ¬yψ
9 8 5 hbxfrbi ¬xφx¬xφ