Metamath Proof Explorer


Theorem cbvaldvaw

Description: Rule used to change the bound variable in a universal quantifier with implicit substitution. Deduction form. Version of cbvaldva with a disjoint variable condition, requiring fewer axioms. (Contributed by David Moews, 1-May-2017) (Revised by Gino Giotto, 10-Jan-2024) Reduce axiom usage, along an idea of Gino Giotto. (Revised by Wolf Lammen, 10-Feb-2024)

Ref Expression
Hypothesis cbvaldvaw.1 ( ( 𝜑𝑥 = 𝑦 ) → ( 𝜓𝜒 ) )
Assertion cbvaldvaw ( 𝜑 → ( ∀ 𝑥 𝜓 ↔ ∀ 𝑦 𝜒 ) )

Proof

Step Hyp Ref Expression
1 cbvaldvaw.1 ( ( 𝜑𝑥 = 𝑦 ) → ( 𝜓𝜒 ) )
2 1 ancoms ( ( 𝑥 = 𝑦𝜑 ) → ( 𝜓𝜒 ) )
3 2 pm5.74da ( 𝑥 = 𝑦 → ( ( 𝜑𝜓 ) ↔ ( 𝜑𝜒 ) ) )
4 3 cbvalvw ( ∀ 𝑥 ( 𝜑𝜓 ) ↔ ∀ 𝑦 ( 𝜑𝜒 ) )
5 19.21v ( ∀ 𝑥 ( 𝜑𝜓 ) ↔ ( 𝜑 → ∀ 𝑥 𝜓 ) )
6 19.21v ( ∀ 𝑦 ( 𝜑𝜒 ) ↔ ( 𝜑 → ∀ 𝑦 𝜒 ) )
7 4 5 6 3bitr3i ( ( 𝜑 → ∀ 𝑥 𝜓 ) ↔ ( 𝜑 → ∀ 𝑦 𝜒 ) )
8 7 pm5.74ri ( 𝜑 → ( ∀ 𝑥 𝜓 ↔ ∀ 𝑦 𝜒 ) )