Theorem rabeqbidva

Description: Equality of restricted class abstractions. (Contributed by Mario Carneiro, 26-Jan-2017)

	Ref	Expression
Hypotheses	rabeqbidva.1	⊢ ( 𝜑 → 𝐴 = 𝐵 )
	rabeqbidva.2	⊢ ( ( 𝜑 ∧ 𝑥 ∈ 𝐴 ) → ( 𝜓 ↔ 𝜒 ) )
Assertion	rabeqbidva	⊢ ( 𝜑 → { 𝑥 ∈ 𝐴 ∣ 𝜓 } = { 𝑥 ∈ 𝐵 ∣ 𝜒 } )

Proof

Step	Hyp	Ref	Expression
1		rabeqbidva.1	⊢ ( 𝜑 → 𝐴 = 𝐵 )
2		rabeqbidva.2	⊢ ( ( 𝜑 ∧ 𝑥 ∈ 𝐴 ) → ( 𝜓 ↔ 𝜒 ) )
3	2	rabbidva	⊢ ( 𝜑 → { 𝑥 ∈ 𝐴 ∣ 𝜓 } = { 𝑥 ∈ 𝐴 ∣ 𝜒 } )
4	1	rabeqdv	⊢ ( 𝜑 → { 𝑥 ∈ 𝐴 ∣ 𝜒 } = { 𝑥 ∈ 𝐵 ∣ 𝜒 } )
5	3 4	eqtrd	⊢ ( 𝜑 → { 𝑥 ∈ 𝐴 ∣ 𝜓 } = { 𝑥 ∈ 𝐵 ∣ 𝜒 } )