| 
                definition:  | 
              
              
                 
addToAssertion :: Term -> TransStateM ()
addToAssertion formula = do
  st <- get
  put $ st { cAssertion = tConj [cAssertion st, formula] }
               | 
              
            
| 
                demand:  | 
              
              
                no demanded arguments  | 
              
            
| 
                deterministic:  | 
              
              
                deterministic operation  | 
              
            
| 
                documentation:  | 
              
              
                Add a formula to the current assertion in the state by conjunction.  | 
              
            
| 
                failfree:  | 
              
              
                _  | 
              
            
| 
                indeterministic:  | 
              
              
                referentially transparent operation  | 
              
            
| 
                infix:  | 
              
              
                no fixity defined  | 
              
            
| 
                iotype:  | 
              
              
                 {(_) |-> _}
               | 
              
            
| 
                name:  | 
              
              
                addToAssertion  | 
              
            
| 
                precedence:  | 
              
              
                no precedence defined  | 
              
            
| 
                result-values:  | 
              
              
                _  | 
              
            
| 
                signature:  | 
              
              
                ESMT.Term -> Control.Monad.Trans.State.StateT TransState Prelude.IO ()  | 
              
            
| 
                solution-complete:  | 
              
              
                operation might suspend on free variables  | 
              
            
| 
                terminating:  | 
              
              
                possibly non-terminating  | 
              
            
| 
                totally-defined:  | 
              
              
                reducible on all ground data terms  |