Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabeq | Unicode version |
Description: Equality theorem for restricted class abstractions. (Contributed by NM, 15-Oct-2003.) |
Ref | Expression |
---|---|
rabeq |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2312 | . 2 | |
2 | nfcv 2312 | . 2 | |
3 | 1, 2 | rabeqf 2720 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1348 crab 2452 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-rab 2457 |
This theorem is referenced by: rabeqdv 2724 rabeqbidv 2725 rabeqbidva 2726 difeq1 3238 ifeq1 3529 ifeq2 3530 elfvmptrab 5591 pmvalg 6637 unfiexmid 6895 ssfirab 6911 supeq2 6966 iooval2 9872 fzval2 9968 lcmval 12017 lcmcllem 12021 lcmledvds 12024 clsfval 12895 |
Copyright terms: Public domain | W3C validator |