Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfint | Unicode version |
Description: Bound-variable hypothesis builder for intersection. (Contributed by NM, 2-Feb-1997.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) |
Ref | Expression |
---|---|
nfint.1 |
Ref | Expression |
---|---|
nfint |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfint2 3617 | . 2 | |
2 | nfint.1 | . . . 4 | |
3 | nfv 1421 | . . . 4 | |
4 | 2, 3 | nfralxy 2360 | . . 3 |
5 | 4 | nfab 2182 | . 2 |
6 | 1, 5 | nfcxfr 2175 | 1 |
Colors of variables: wff set class |
Syntax hints: cab 2026 wnfc 2165 wral 2306 cint 3615 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-int 3616 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |