| 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 2366, 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 2367 | . 2 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴) |
| 3 | 2 | nfi 1510 | 1 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴 |
| Colors of variables: wff set class |
| Syntax hints: Ⅎwnf 1508 ∈ wcel 2202 Ⅎwnfc 2361 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-sb 1811 df-cleq 2224 df-clel 2227 df-nfc 2363 |
| This theorem is referenced by: clelsb1f 2378 nfnfc 2381 nfeq 2382 nfel 2383 cleqf 2399 sbabel 2401 r2alf 2549 r2exf 2550 nfrabw 2714 cbvralfw 2756 cbvrexfw 2757 cbvralf 2758 cbvrexf 2759 cbvrab 2800 rmo3f 3003 nfccdeq 3029 sbcabel 3114 cbvcsbw 3131 cbvcsb 3132 cbvralcsf 3190 cbvrexcsf 3191 cbvreucsf 3192 cbvrabcsf 3193 dfss2f 3218 nfdif 3328 nfun 3363 nfin 3413 nfop 3878 nfiunxy 3996 nfiinxy 3997 nfiunya 3998 nfiinya 3999 cbviun 4007 cbviin 4008 iunxsngf 4048 cbvdisj 4074 nfdisjv 4076 disjiun 4083 nfmpt 4181 cbvmptf 4183 nffrfor 4445 onintrab2im 4616 tfis 4681 nfxp 4752 opeliunxp 4781 iunxpf 4878 elrnmpt1 4983 fvmptssdm 5731 nfmpo 6090 cbvmpox 6099 fmpox 6365 nffrec 6562 cc3 7487 nfsum1 11921 nfsum 11922 fsum2dlemstep 12000 fisumcom2 12004 nfcprod1 12120 nfcprod 12121 cbvprod 12124 fprod2dlemstep 12188 fprodcom2fi 12192 ctiunctlemudc 13063 ctiunctlemfo 13065 |
| Copyright terms: Public domain | W3C validator |