| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfcri | Unicode version | ||
| Description: Consequence of the
not-free predicate. (Note that unlike nfcr 2384, this
does not require |
| Ref | Expression |
|---|---|
| nfcri.1 |
|
| Ref | Expression |
|---|---|
| nfcri |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcri.1 |
. . 3
| |
| 2 | 1 | nfcrii 2385 |
. 2
|
| 3 | 2 | nfi 1515 |
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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-cleq 2231 df-clel 2234 df-nfc 2381 |
| This theorem is referenced by: clelsb1f 2396 nfnfc 2399 nfeq 2400 nfel 2401 cleqf 2417 sbabel 2419 r2alf 2567 r2exf 2568 nfrabw 2733 cbvralfw 2775 cbvrexfw 2776 cbvralf 2777 cbvrexf 2778 cbvrab 2819 rmo3f 3023 nfccdeq 3049 sbcabel 3134 cbvcsbw 3151 cbvcsb 3152 cbvralcsf 3210 cbvrexcsf 3211 cbvreucsf 3212 cbvrabcsf 3213 dfssf 3238 dfss2f 3239 nfdif 3350 nfun 3385 nfin 3437 nfop 3915 nfiunxy 4033 nfiinxy 4034 nfiunya 4035 nfiinya 4036 cbviun 4044 cbviin 4045 iunxsngf 4085 cbvdisj 4111 nfdisjv 4113 disjiun 4120 nfmpt 4218 cbvmptf 4220 nffrfor 4488 onintrab2im 4660 tfis 4725 nfxp 4796 opeliunxp 4825 iunxpf 4923 elrnmpt1 5028 fvmptssdm 5784 nfmpo 6147 cbvmpox 6156 abrexss 6348 fmpox 6426 nffrec 6657 cc3 7624 nfsum1 12100 nfsum 12101 fsum2dlemstep 12179 fisumcom2 12183 nfcprod1 12299 nfcprod 12300 cbvprod 12303 fprod2dlemstep 12367 fprodcom2fi 12371 ctiunctlemudc 13306 ctiunctlemfo 13308 |
| Copyright terms: Public domain | W3C validator |