Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfbidf | Unicode version |
Description: An equality theorem for effectively not free. (Contributed by Mario Carneiro, 4-Oct-2016.) |
Ref | Expression |
---|---|
nfbidf.1 | |
nfbidf.2 |
Ref | Expression |
---|---|
nfbidf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfbidf.1 | . . . 4 | |
2 | 1 | nfri 1412 | . . 3 |
3 | nfbidf.2 | . . . 4 | |
4 | 2, 3 | albidh 1369 | . . . 4 |
5 | 3, 4 | imbi12d 223 | . . 3 |
6 | 2, 5 | albidh 1369 | . 2 |
7 | df-nf 1350 | . 2 | |
8 | df-nf 1350 | . 2 | |
9 | 6, 7, 8 | 3bitr4g 212 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 98 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-gen 1338 ax-4 1400 |
This theorem depends on definitions: df-bi 110 df-nf 1350 |
This theorem is referenced by: dvelimdf 1892 nfcjust 2166 nfceqdf 2177 |
Copyright terms: Public domain | W3C validator |