After defining a recursive function, I can type, say, csatis.simps in my case to get this fun
If I would like to prove an alternative definition, and I would like the same format, in the sense of if I type thm csatis_alt
, it still gives me this five dots. What should I type when stating the theorem to be proved?
It seems not the &&&
. For instance, I tried
lemma csatis_simps1:"
A &&& B
" sorry
and I typed thm csatis_simps1
. It just says A &&& B
, instead of giving me two "dots".
lemma cstatis_simps:
"A"
"B"
"C"
That works, thanks!!!
Last updated: Dec 21 2024 at 16:20 UTC