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

Definition df-s1 11068
Description: Define the canonical injection from symbols to words. Although not required,  A should usually be a set. Otherwise, the singleton word  <" A "> 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  |-  <" A ">  =  { <. 0 ,  (  _I  `  A ) >. }

Detailed syntax breakdown of Definition df-s1
StepHypRef Expression
1 cA . . 3  class  A
21cs1 11067 . 2  class  <" A ">
3 cc0 7924 . . . 4  class  0
4 cid 4334 . . . . 5  class  _I
51, 4cfv 5270 . . . 4  class  (  _I 
`  A )
63, 5cop 3635 . . 3  class  <. 0 ,  (  _I  `  A
) >.
76csn 3632 . 2  class  { <. 0 ,  (  _I  `  A ) >. }
82, 7wceq 1372 1  wff  <" A ">  =  { <. 0 ,  (  _I  `  A ) >. }
Colors of variables: wff set class
This definition is referenced by:  s1val  11069  s1eq  11071  s1prc  11075
  Copyright terms: Public domain W3C validator