Metamath Proof Explorer


Theorem cbvmovw

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. See cbvmo and cbvmow for versions with fewer disjoint variable conditions but requiring more axioms. (Contributed by NM, 9-Mar-1995) (Revised by Gino Giotto, 30-Sep-2024)

Ref Expression
Hypothesis cbvmovw.1 ( 𝑥 = 𝑦 → ( 𝜑𝜓 ) )
Assertion cbvmovw ( ∃* 𝑥 𝜑 ↔ ∃* 𝑦 𝜓 )

Proof

Step Hyp Ref Expression
1 cbvmovw.1 ( 𝑥 = 𝑦 → ( 𝜑𝜓 ) )
2 equequ1 ( 𝑥 = 𝑦 → ( 𝑥 = 𝑧𝑦 = 𝑧 ) )
3 1 2 imbi12d ( 𝑥 = 𝑦 → ( ( 𝜑𝑥 = 𝑧 ) ↔ ( 𝜓𝑦 = 𝑧 ) ) )
4 3 cbvalvw ( ∀ 𝑥 ( 𝜑𝑥 = 𝑧 ) ↔ ∀ 𝑦 ( 𝜓𝑦 = 𝑧 ) )
5 4 exbii ( ∃ 𝑧𝑥 ( 𝜑𝑥 = 𝑧 ) ↔ ∃ 𝑧𝑦 ( 𝜓𝑦 = 𝑧 ) )
6 df-mo ( ∃* 𝑥 𝜑 ↔ ∃ 𝑧𝑥 ( 𝜑𝑥 = 𝑧 ) )
7 df-mo ( ∃* 𝑦 𝜓 ↔ ∃ 𝑧𝑦 ( 𝜓𝑦 = 𝑧 ) )
8 5 6 7 3bitr4i ( ∃* 𝑥 𝜑 ↔ ∃* 𝑦 𝜓 )