| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfcri | GIF version | ||
| Description: Consequence of the not-free predicate. (Note that unlike nfcr 2384, this does not require 𝑦 and 𝐴 to be disjoint.) (Contributed by Mario Carneiro, 11-Aug-2016.) |
| 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: Ⅎwnf 1513 ∈ wcel 2209 Ⅎwnfc 2379 |
| 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 3918 nfiunxy 4036 nfiinxy 4037 nfiunya 4038 nfiinya 4039 cbviun 4047 cbviin 4048 iunxsngf 4088 cbvdisj 4114 nfdisjv 4116 disjiun 4123 nfmpt 4221 cbvmptf 4223 nffrfor 4491 onintrab2im 4663 tfis 4728 nfxp 4799 opeliunxp 4828 iunxpf 4926 elrnmpt1 5031 fvmptssdm 5787 nfmpo 6151 cbvmpox 6160 abrexss 6352 fmpox 6430 nffrec 6661 cc3 7628 nfsum1 12105 nfsum 12106 fsum2dlemstep 12184 fisumcom2 12188 nfcprod1 12304 nfcprod 12305 cbvprod 12308 fprod2dlemstep 12372 fprodcom2fi 12376 ctiunctlemudc 13311 ctiunctlemfo 13313 |
| Copyright terms: Public domain | W3C validator |