Metamath Proof Explorer


Theorem bj-cbvalimd0

Description: A lemma for alpha-renaming of variables bound by a universal quantifier. In applications, x = y will be substituted for ps and ax6ev will prove Hypothesis bj-cbvalimd0.denote. When ax6ev is not available but only its universal closure is, then bj-cbvalimd or bj-cbvalimdv should be used (see bj-cbvalimdlem , bj-cbval ). (Contributed by BJ, 4-Apr-2026)

Ref Expression
Hypotheses bj-cbvalimd0.nf0 φ x φ
bj-cbvalimd0.nf1 φ y φ
bj-cbvalimd0.nfch φ χ y χ
bj-cbvalimd0.nfth φ x θ θ
bj-cbvalimd0.denote φ x ψ
bj-cbvalimd0.maj φ ψ χ θ
Assertion bj-cbvalimd0 φ x χ y θ

Proof

Step Hyp Ref Expression
1 bj-cbvalimd0.nf0 φ x φ
2 bj-cbvalimd0.nf1 φ y φ
3 bj-cbvalimd0.nfch φ χ y χ
4 bj-cbvalimd0.nfth φ x θ θ
5 bj-cbvalimd0.denote φ x ψ
6 bj-cbvalimd0.maj φ ψ χ θ
7 1 3 hbald φ x χ y x χ
8 1 4 5 6 bj-spim φ x χ θ
9 2 7 8 bj-alrimd φ x χ y θ