Metamath Proof Explorer


Theorem cbvalw

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 9-Apr-2017)

Ref Expression
Hypotheses cbvalw.1 ⊢ ∀ x φ → ∀ y ∀ x φ
cbvalw.2 ⊢ ¬ ψ → ∀ x ¬ ψ
cbvalw.3 ⊢ ∀ y ψ → ∀ x ∀ y ψ
cbvalw.4 ⊢ ¬ φ → ∀ y ¬ φ
cbvalw.5 ⊢ x = y → φ ↔ ψ
Assertion cbvalw ⊢ ∀ x φ ↔ ∀ y ψ

Proof

Step Hyp Ref Expression
1 cbvalw.1 ⊢ ∀ x φ → ∀ y ∀ x φ
2 cbvalw.2 ⊢ ¬ ψ → ∀ x ¬ ψ
3 cbvalw.3 ⊢ ∀ y ψ → ∀ x ∀ y ψ
4 cbvalw.4 ⊢ ¬ φ → ∀ y ¬ φ
5 cbvalw.5 ⊢ x = y → φ ↔ ψ
6 5 biimpd ⊢ x = y → φ → ψ
7 1 2 6 cbvaliw ⊢ ∀ x φ → ∀ y ψ
8 5 biimprd ⊢ x = y → ψ → φ
9 8 equcoms ⊢ y = x → ψ → φ
10 3 4 9 cbvaliw ⊢ ∀ y ψ → ∀ x φ
11 7 10 impbii ⊢ ∀ x φ ↔ ∀ y ψ