Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rabeqf | Structured version Visualization version GIF version |
Description: Equality theorem for restricted class abstractions, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.) |
Ref | Expression |
---|---|
rabeqf.1 | ⊢ Ⅎ𝑥𝐴 |
rabeqf.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
rabeqf | ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabeqf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
2 | rabeqf.2 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
3 | 1, 2 | nfeq 2991 | . . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
4 | eleq2 2901 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
5 | 4 | anbi1d 631 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑))) |
6 | 3, 5 | abbid 2887 | . 2 ⊢ (𝐴 = 𝐵 → {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}) |
7 | df-rab 3147 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
8 | df-rab 3147 | . 2 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} | |
9 | 6, 7, 8 | 3eqtr4g 2881 | 1 ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {cab 2799 Ⅎwnfc 2961 {crab 3142 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 |
This theorem is referenced by: fpwrelmapffs 30470 rabeq12f 35450 issmfdf 43034 smfpimltmpt 43043 smfpimltxrmpt 43055 smfpimgtmpt 43077 smfpimgtxrmpt 43080 smfsupmpt 43109 smfinfmpt 43113 |
Copyright terms: Public domain | W3C validator |