| 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 2375 | . 2 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2375 | . 2 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | rabeqf 2793 | 1 ⊢ (𝐴 = 𝐵 → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐵 ∣ 𝜑}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 {crab 2515 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rab 2520 |
| This theorem is referenced by: rabeqdv 2797 rabeqbidv 2798 rabeqbidva 2799 difeq1 3320 ifeq1 3612 ifeq2 3613 elfvmptrab 5751 supp0 6416 pmvalg 6871 unfiexmid 7153 ssfirab 7172 supeq2 7231 iooval2 10194 fzval2 10291 clsfval 14895 incistruhgr 16014 |
| Copyright terms: Public domain | W3C validator |