ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-s1 GIF version

Definition df-s1 11068
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.)
Assertion
Ref Expression
df-s1 ⟨“𝐴”⟩ = {⟨0, ( I ‘𝐴)⟩}

Detailed syntax breakdown of Definition df-s1
StepHypRef Expression
1 cA . . 3 class 𝐴
21cs1 11067 . 2 class ⟨“𝐴”⟩
3 cc0 7924 . . . 4 class 0
4 cid 4334 . . . . 5 class I
51, 4cfv 5270 . . . 4 class ( I ‘𝐴)
63, 5cop 3635 . . 3 class ⟨0, ( I ‘𝐴)⟩
76csn 3632 . 2 class {⟨0, ( I ‘𝐴)⟩}
82, 7wceq 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