Theorem rabeqbidv 2855

Description: Equality of restricted class abstractions. (Contributed by Jeff Madsen, 1-Dec-2009.)

Hypotheses

Ref	Expression
rabeqbidv.1	⊢ (φ → A = B)
rabeqbidv.2	⊢ (φ → (ψ ↔ χ))

Assertion

Ref	Expression
rabeqbidv	⊢ (φ → {x ∈ A ∣ ψ} = {x ∈ B ∣ χ})

Distinct variable groups:   x,A   x,B   φ,x

Allowed substitution hints:   ψ(x)   χ(x)

Proof of Theorem rabeqbidv

Step	Hyp	Ref	Expression
1		rabeqbidv.1	. . 3 ⊢ (φ → A = B)
2		rabeq 2854	. . 3 ⊢ (A = B → {x ∈ A ∣ ψ} = {x ∈ B ∣ ψ})
3	1, 2	syl 15	. 2 ⊢ (φ → {x ∈ A ∣ ψ} = {x ∈ B ∣ ψ})
4		rabeqbidv.2	. . 3 ⊢ (φ → (ψ ↔ χ))
5	4	rabbidv 2852	. 2 ⊢ (φ → {x ∈ B ∣ ψ} = {x ∈ B ∣ χ})
6	3, 5	eqtrd 2385	1 ⊢ (φ → {x ∈ A ∣ ψ} = {x ∈ B ∣ χ})

Syntax hints:   → wi 4   ↔ wb 176   = wceq 1642  {crab 2619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-rab 2624

This theorem is referenced by:  pmvalg  6011