| 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 2341, this
does not require |
| Ref | Expression |
|---|---|
| nfcri.1 |
|
| Ref | Expression |
|---|---|
| nfcri |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcri.1 |
. . 3
| |
| 2 | 1 | nfcrii 2342 |
. 2
|
| 3 | 2 | nfi 1486 |
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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-nf 1485 df-sb 1787 df-cleq 2199 df-clel 2202 df-nfc 2338 |
| This theorem is referenced by: clelsb1f 2353 nfnfc 2356 nfeq 2357 nfel 2358 cleqf 2374 sbabel 2376 r2alf 2524 r2exf 2525 nfrabw 2688 cbvralfw 2729 cbvrexfw 2730 cbvralf 2731 cbvrexf 2732 cbvrab 2771 rmo3f 2974 nfccdeq 3000 sbcabel 3084 cbvcsbw 3101 cbvcsb 3102 cbvralcsf 3160 cbvrexcsf 3161 cbvreucsf 3162 cbvrabcsf 3163 dfss2f 3188 nfdif 3298 nfun 3333 nfin 3383 nfop 3841 nfiunxy 3959 nfiinxy 3960 nfiunya 3961 nfiinya 3962 cbviun 3970 cbviin 3971 iunxsngf 4011 cbvdisj 4037 nfdisjv 4039 disjiun 4046 nfmpt 4144 cbvmptf 4146 nffrfor 4403 onintrab2im 4574 tfis 4639 nfxp 4710 opeliunxp 4738 iunxpf 4834 elrnmpt1 4938 fvmptssdm 5677 nfmpo 6027 cbvmpox 6036 fmpox 6299 nffrec 6495 cc3 7400 nfsum1 11742 nfsum 11743 fsum2dlemstep 11820 fisumcom2 11824 nfcprod1 11940 nfcprod 11941 cbvprod 11944 fprod2dlemstep 12008 fprodcom2fi 12012 ctiunctlemudc 12883 ctiunctlemfo 12885 |
| Copyright terms: Public domain | W3C validator |