Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  df-mufs Structured version   Visualization version   Unicode version

Definition df-mufs 31499
Description: Define the set of unambiguous formal systems. (Contributed by Mario Carneiro, 14-Jul-2016.)
Assertion
Ref Expression
df-mufs  |- mUFS  =  {
t  e. mGFS  |  Fun  (mST `  t ) }

Detailed syntax breakdown of Definition df-mufs
StepHypRef Expression
1 cmufs 31491 . 2  class mUFS
2 vt . . . . . 6  setvar  t
32cv 1482 . . . . 5  class  t
4 cmst 31489 . . . . 5  class mST
53, 4cfv 5888 . . . 4  class  (mST `  t )
65wfun 5882 . . 3  wff  Fun  (mST `  t )
7 cmgfs 31487 . . 3  class mGFS
86, 2, 7crab 2916 . 2  class  { t  e. mGFS  |  Fun  (mST `  t ) }
91, 8wceq 1483 1  wff mUFS  =  {
t  e. mGFS  |  Fun  (mST `  t ) }
Colors of variables: wff setvar class
This definition is referenced by: (None)
  Copyright terms: Public domain W3C validator