| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rabeq | GIF version | ||
| Description: Equality theorem for restricted class abstractions. (Contributed by NM, 15-Oct-2003.) |
| Ref | Expression |
|---|---|
| rabeq | ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2374 | . 2 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2374 | . 2 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | rabeqf 2792 | 1 ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 {crab 2514 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rab 2519 |
| This theorem is referenced by: rabeqdv 2796 rabeqbidv 2797 rabeqbidva 2798 difeq1 3318 ifeq1 3608 ifeq2 3609 elfvmptrab 5742 pmvalg 6827 unfiexmid 7109 ssfirab 7128 supeq2 7187 iooval2 10149 fzval2 10245 clsfval 14824 incistruhgr 15940 |
| Copyright terms: Public domain | W3C validator |