Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfald | Unicode version |
Description: If is not free in , it is not free in . (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 6-Jan-2018.) |
Ref | Expression |
---|---|
nfald.1 | |
nfald.2 |
Ref | Expression |
---|---|
nfald |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfald.1 | . . . 4 | |
2 | 1 | nfri 1412 | . . 3 |
3 | nfald.2 | . . 3 | |
4 | 2, 3 | alrimih 1358 | . 2 |
5 | nfnf1 1436 | . . . 4 | |
6 | 5 | nfal 1468 | . . 3 |
7 | hba1 1433 | . . . 4 | |
8 | sp 1401 | . . . . 5 | |
9 | 8 | nfrd 1413 | . . . 4 |
10 | 7, 9 | hbald 1380 | . . 3 |
11 | 6, 10 | nfd 1416 | . 2 |
12 | 4, 11 | syl 14 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wal 1241 wnf 1349 |
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-5 1336 ax-7 1337 ax-gen 1338 ax-4 1400 ax-ial 1427 |
This theorem depends on definitions: df-bi 110 df-nf 1350 |
This theorem is referenced by: dvelimALT 1886 dvelimfv 1887 nfeudv 1915 nfeqd 2192 nfraldxy 2356 nfiotadxy 4870 bdsepnft 10007 strcollnft 10109 |
Copyright terms: Public domain | W3C validator |