Theorem rabeqf 3165

Description: Equality theorem for restricted class abstractions, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.)

Hypotheses

Ref	Expression
rabeqf.1	⊢ Ⅎ𝑥𝐴
rabeqf.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
rabeqf	⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑})

Proof of Theorem rabeqf

Step	Hyp	Ref	Expression
1		rabeqf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2		rabeqf.2	. . . 4 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfeq 2762	. . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		eleq2 2677	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	anbi1d 737	. . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)))
6	3, 5	abbid 2727	. 2 ⊢ (𝐴 = 𝐵 → {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)})
7		df-rab 2905	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
8		df-rab 2905	. 2 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
9	6, 7, 8	3eqtr4g 2669	1 ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑})

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596  Ⅎwnfc 2738  {crab 2900

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905

This theorem is referenced by:  rabeq  3166  fpwrelmapffs  28897  rabeq12f  33135  rabeqif  38320  issmfdf  39624  smfpimltmpt  39633  smfpimltxrmpt  39645  smfpimgtmpt  39667  smfpimgtxrmpt  39670