Metamath Proof Explorer


Theorem cbvmptv

Description: Rule to change the bound variable in a maps-to function, using implicit substitution. (Contributed by Mario Carneiro, 19-Feb-2013) Add disjoint variable condition to avoid auxiliary axioms . See cbvmptvg for a less restrictive version requiring more axioms. (Revised by GG, 17-Nov-2024)

Ref Expression
Hypothesis cbvmptv.1 ⊢ x = y → B = C
Assertion cbvmptv ⊢ x ∈ A ⟼ B = y ∈ A ⟼ C

Proof

Step Hyp Ref Expression
1 cbvmptv.1 ⊢ x = y → B = C
2 eleq1w ⊢ x = y → x ∈ A ↔ y ∈ A
3 1 eqeq2d ⊢ x = y → z = B ↔ z = C
4 2 3 anbi12d ⊢ x = y → x ∈ A ∧ z = B ↔ y ∈ A ∧ z = C
5 4 cbvopab1v ⊢ x z | x ∈ A ∧ z = B = y z | y ∈ A ∧ z = C
6 df-mpt ⊢ x ∈ A ⟼ B = x z | x ∈ A ∧ z = B
7 df-mpt ⊢ y ∈ A ⟼ C = y z | y ∈ A ∧ z = C
8 5 6 7 3eqtr4i ⊢ x ∈ A ⟼ B = y ∈ A ⟼ C