Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfceqdf | Unicode version |
Description: An equality theorem for effectively not free. (Contributed by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
nfceqdf.1 | |
nfceqdf.2 |
Ref | Expression |
---|---|
nfceqdf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfceqdf.1 | . . . 4 | |
2 | nfceqdf.2 | . . . . 5 | |
3 | 2 | eleq2d 2227 | . . . 4 |
4 | 1, 3 | nfbidf 1519 | . . 3 |
5 | 4 | albidv 1804 | . 2 |
6 | df-nfc 2288 | . 2 | |
7 | df-nfc 2288 | . 2 | |
8 | 5, 6, 7 | 3bitr4g 222 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wal 1333 wceq 1335 wnf 1440 wcel 2128 wnfc 2286 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1427 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-4 1490 ax-17 1506 ax-ial 1514 ax-ext 2139 |
This theorem depends on definitions: df-bi 116 df-nf 1441 df-cleq 2150 df-clel 2153 df-nfc 2288 |
This theorem is referenced by: nfopd 3758 dfnfc2 3790 nfimad 4936 nffvd 5479 |
Copyright terms: Public domain | W3C validator |