Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfin | Structured version Visualization version Unicode version |
Description: Bound-variable hypothesis builder for the intersection of classes. (Contributed by NM, 15-Sep-2003.) (Revised by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
nfin.1 | |
nfin.2 |
Ref | Expression |
---|---|
nfin |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfin5 3582 | . 2 | |
2 | nfin.2 | . . . 4 | |
3 | 2 | nfcri 2758 | . . 3 |
4 | nfin.1 | . . 3 | |
5 | 3, 4 | nfrab 3123 | . 2 |
6 | 1, 5 | nfcxfr 2762 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wcel 1990 wnfc 2751 crab 2916 cin 3573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rab 2921 df-in 3581 |
This theorem is referenced by: csbin 4010 iunxdif3 4606 disjxun 4651 nfres 5398 nfpred 5685 cp 8754 tskwe 8776 iunconn 21231 ptclsg 21418 restmetu 22375 limciun 23658 disjunsn 29407 ordtconnlem1 29970 esum2d 30155 finminlem 32312 mbfposadd 33457 csbingOLD 39054 iunconnlem2 39171 inn0f 39242 disjrnmpt2 39375 disjinfi 39380 fsumiunss 39807 stoweidlem57 40274 fourierdlem80 40403 sge0iunmptlemre 40632 iundjiun 40677 pimiooltgt 40921 smflim 40985 smfpimcclem 41013 smfpimcc 41014 |
Copyright terms: Public domain | W3C validator |