| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > df-s1 | GIF version | ||
| Description: Define the canonical injection from symbols to words. Although not required, 𝐴 should usually be a set. Otherwise, the singleton word 〈“𝐴”〉 would be the singleton word consisting of the empty set, see s1prc 11075, and not, as maybe expected, the empty word. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| df-s1 | ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cA | . . 3 class 𝐴 | |
| 2 | 1 | cs1 11067 | . 2 class 〈“𝐴”〉 |
| 3 | cc0 7924 | . . . 4 class 0 | |
| 4 | cid 4334 | . . . . 5 class I | |
| 5 | 1, 4 | cfv 5270 | . . . 4 class ( I ‘𝐴) |
| 6 | 3, 5 | cop 3635 | . . 3 class 〈0, ( I ‘𝐴)〉 |
| 7 | 6 | csn 3632 | . 2 class {〈0, ( I ‘𝐴)〉} |
| 8 | 2, 7 | wceq 1372 | 1 wff 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} |
| Colors of variables: wff set class |
| This definition is referenced by: s1val 11069 s1eq 11071 s1prc 11075 |
| Copyright terms: Public domain | W3C validator |