| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfopab1 | Unicode version | ||
| Description: The first abstraction variable in an ordered-pair class abstraction (class builder) is effectively not free. (Contributed by NM, 16-May-1995.) (Revised by Mario Carneiro, 14-Oct-2016.) |
| Ref | Expression |
|---|---|
| nfopab1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-opab 4151 |
. 2
| |
| 2 | nfe1 1544 |
. . 3
| |
| 3 | 2 | nfab 2379 |
. 2
|
| 4 | 1, 3 | nfcxfr 2371 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-opab 4151 |
| This theorem is referenced by: nfmpt1 4182 opelopabsb 4354 ssopab2b 4371 dmopab 4942 rnopab 4979 funopab 5361 0neqopab 6065 |
| Copyright terms: Public domain | W3C validator |