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

Definition df-mufs 32965
Description: Define the set of unambiguous formal systems. (Contributed by Mario Carneiro, 14-Jul-2016.)
Assertion
Ref Expression
df-mufs mUFS = {𝑡 ∈ mGFS ∣ Fun (mST‘𝑡)}

Detailed syntax breakdown of Definition df-mufs
StepHypRef Expression
1 cmufs 32955 . 2 class mUFS
2 vt . . . . . 6 setvar 𝑡
32cv 1537 . . . . 5 class 𝑡
4 cmst 32953 . . . . 5 class mST
53, 4cfv 6328 . . . 4 class (mST‘𝑡)
65wfun 6322 . . 3 wff Fun (mST‘𝑡)
7 cmgfs 32951 . . 3 class mGFS
86, 2, 7crab 3113 . 2 class {𝑡 ∈ mGFS ∣ Fun (mST‘𝑡)}
91, 8wceq 1538 1 wff mUFS = {𝑡 ∈ mGFS ∣ Fun (mST‘𝑡)}
Colors of variables: wff setvar class
This definition is referenced by: (None)
  Copyright terms: Public domain W3C validator