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 3985 | . 2 | |
2 | nfe1 1472 | . . 3 | |
3 | 2 | nfab 2284 | . 2 |
4 | 1, 3 | nfcxfr 2276 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 103 wceq 1331 wex 1468 cab 2123 wnfc 2266 cop 3525 copab 3983 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-opab 3985 |
This theorem is referenced by: nfmpt1 4016 opelopabsb 4177 ssopab2b 4193 dmopab 4745 rnopab 4781 funopab 5153 0neqopab 5809 |
Copyright terms: Public domain | W3C validator |