| 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 |
| This proof depends on syntax axioms:
|
| This proof depends on 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 proof depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-cleq 2231 df-clel 2234 df-nfc 2381 |
| This theorem is used 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 3920 nfiunxy 4038 nfiinxy 4039 nfiunya 4040 nfiinya 4041 cbviun 4049 cbviin 4050 iunxsngf 4090 cbvdisj 4116 nfdisjv 4118 disjiun 4125 nfmpt 4225 cbvmptf 4227 nffrfor 4495 onintrab2im 4667 tfis 4732 nfxp 4803 opeliunxp 4832 iunxpf 4930 elrnmpt1 5035 fvmptssdm 5793 nfmpo 6160 cbvmpox 6169 abrexss 6362 fmpox 6440 nffrec 6671 cc3 7640 nfsum1 12147 nfsum 12148 fsum2dlemstep 12226 fisumcom2 12230 nfcprod1 12346 nfcprod 12347 cbvprod 12350 fprod2dlemstep 12414 fprodcom2fi 12418 ctiunctlemudc 13386 ctiunctlemfo 13388 |
| Copyright terms: Public domain | W3C validator |