HEX
Server: Apache/2.4.67 (Debian)
System: Linux vps-b2547eb4 6.1.0-41-cloud-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.158-1 (2025-11-09) x86_64
User: root (0)
PHP: 8.2.31
Disabled: NONE
Upload Files
File: //lib/python3/dist-packages/pygments/lexers/__pycache__/theorem.cpython-311.pyc
�

�E�c�N���dZddlmZmZmZddlmZmZmZm	Z	m
Z
mZmZm
Z
mZmZgd�ZGd�de��ZGd�de��ZGd	�d
e��ZdS)z�
    pygments.lexers.theorem
    ~~~~~~~~~~~~~~~~~~~~~~~

    Lexers for theorem-proving languages.

    :copyright: Copyright 2006-2022 by the Pygments team, see AUTHORS.
    :license: BSD, see LICENSE for details.
�)�
RegexLexer�default�words)
�Text�Comment�Operator�Keyword�Name�String�Number�Punctuation�Generic�
Whitespace)�CoqLexer�
IsabelleLexer�	LeanLexerc�>�eZdZdZdZdZdgZdgZdgZdZ	dZ
d	Zd
ZdZ
dZd
ZdZdZdZdZdefdejjfdedfdefdejfdejfee
dd���ejfeedd���efeedd���ejfee
dd���efeedd���ejfeedd���ejfdefdd�eddd���zefd e�de�d!e��efd"efd#e j!fd$e j"fd%e j#fd&e j$fd'e j%fd(e&j'fd)e&j'fd*efd+e&j(d,fd-efd.ejjfgd/efded0fd1ed2fd3efgd4e&j(fd5e&j(fd+e&j(d2fgdefd6e)fd7ejfd8ej*d2fd9ed2fe+d2��gd:�Z,d;�Z-dS)<rz@
    For the Coq theorem prover.

    .. versionadded:: 1.5
    �Coqzhttp://coq.inria.fr/�coqz*.vz
text/x-coqr)Z�Section�Module�End�Require�Import�Export�Variable�	Variables�	Parameter�
Parameters�Axiom�Axioms�
Hypothesis�
Hypotheses�Notation�Local�Tactic�Reserved�Scope�Open�Close�Bind�Delimit�
Definition�Example�Let�Ltac�Fixpoint�
CoFixpoint�Morphism�Relation�Implicit�	Arguments�Types�Unset�
Contextual�Strict�Prenex�	Implicits�	Inductive�CoInductive�Record�	Structure�Variant�	Canonical�Coercion�Theorem�Lemma�Fact�Remark�	Corollary�Proposition�Property�Goal�Proof�Restart�Save�Qed�Defined�Abort�Admitted�Hint�Resolve�Rewrite�View�Search�Compute�Eval�Show�Print�Printing�All�Graph�Projections�inside�outside�Check�Global�Instance�Class�Existing�Universe�Polymorphic�Monomorphic�Context�Scheme�From�Undo�Fail�Function)�forall�exists�exists2�fun�fix�cofix�struct�match�end�in�return�let�if�is�then�else�for�of�nosimpl�with�as)�Type�Prop�SProp�Set)C�pose�set�move�case�elim�apply�clear�hnf�intro�intros�
generalize�rename�pattern�after�destruct�	induction�using�refine�	inversion�	injection�rewrite�congr�unlock�compute�ring�field�replace�fold�unfold�change�
cutrewrite�simpl�have�suff�wlog�suffices�without�loss�nat_norm�assert�cut�trivial�revert�
bool_congr�	nat_congr�symmetry�transitivity�auto�split�left�right�autorewrite�tauto�setoid_rewrite�	intuition�eauto�eapply�econstructor�
etransitivity�constructor�erewrite�red�cbv�lazy�
vm_compute�native_compute�subst)�by�now�done�exact�reflexivityr��romega�omega�lia�nia�lra�nra�psatz�
assumption�solve�
contradiction�discriminate�
congruence�admit)�do�last�first�try�idtac�repeat):z!=�#�&z&&z\(z\)z\*z\+�,�-z-\.z->�\.z\.\.�:�::�:=z:>�;z;;�<z<-z<->�=�>z>]z>\}z\?z\?\?z\[z\[<z\[>z\[\|�]�_�`z\{z\{<z\|z\|]z\}�~z=>z/\\z\\/z\{\|z\|\}uλ�¬u∧u∨u∀u∃u→u↔u≠u≤u≥z[!$%&*+\./:<=>?@^|~-]z[!?~]z[=<>@^|&+\*/$%-]�\s+zfalse|true|\(\)|\[\]�\(\*�commentz'\b(?:[^\W\d][\w\']*\.)+[^\W\d][\w\']*\bz\bEquations\b\??z"\bSet(?=[ \t]+[A-Z][a-z][^\n]*?\.)�\b��prefix�suffixz\b([A-Z][\w\']*)z(%s)�|N����(z)?z
[^\W\d][\w']*z\d[\d_]*�0[xX][\da-fA-F][\da-fA-F_]*�0[oO][0-7][0-7_]*�0[bB][01][01_]*z(-?\d[\d_]*(.[\d_]*)?([eE][+\-]?\d[\d_]*)z7'(?:(\\[\\\"'ntbr ])|(\\[0-9]{3})|(\\x[0-9a-fA-F]{2}))'z'.'�'�"�string�[~?][a-z][\w\']*:�\S�[^(*)]+�#push�\*\)�#pop�[(*)]z[^"]+z""r�z[A-Z][\w\']*(?=\s*\.)z[A-Z][\w\']*z[a-z][a-z0-9_\']*)�rootr�r�dottedc��d|vrd|vrdSdSdS)NrOrL��)�texts �9/usr/lib/python3/dist-packages/pygments/lexers/theorem.py�analyse_textzCoqLexer.analyse_text�s#���D�=�=�W��_�_��1��=�_�_�).�__name__�
__module__�__qualname__�__doc__�name�url�aliases�	filenames�	mimetypes�flags�	keywords1�	keywords2�	keywords3�	keywords4�	keywords5�	keywords6�keyopts�	operators�prefix_syms�
infix_symsrr
�Builtin�Pseudorr	�	Namespacerr�r'�joinrr�Integer�Hex�Oct�Bin�Floatr�Char�Doubler
rer�tokensrrrrrrs����������D�
 �C��g�G���I���I�
�E��I�$�I��I�
�I��I��I��G�)�I��K�$�J��T�N�
$�d�l�&9�:�
�g�y�)�
7��>�
 �'�"3�4�
2�G�4E�F�
�U�9�U�5�
9�
9�
9�7�;L�M�
�U�9�U�5�
9�
9�
9�7�C�
�U�9�U�5�
9�
9�
9�7�<�H�
�U�9�U�5�
9�
9�
9�7�C�
�U�9�U�5�
9�
9�
9�7�>�J�
�U�9�U�5�
9�
9�
9�7�;K�L�
 �$�'�
�s�x�x����"��
�.�.�
.��9�9�(�j�j�+�+�+�y�y�
A�8�L�
�t�$�
�&�.�)�
+�V�Z�8�
!�6�:�.�
���,�
8�&�,�G�
G���U�
�V�[�!�
�7�O�
�6�=�(�+�
!�4�(�
�D�L�'�(�G$
�L��!�
�g�w�'�
�g�v�&�
�w��	
��v�}�%�
�F�M�"�
�6�=�&�)�
��T�N�
�K� �
%�t�~�6�
�d�j�&�1�
!�4��0��G�F�O�O�

�c9�9�F�v����rrc���eZdZdZdZdZdgZdgZdgZdZ	dZ
d	Zd
ZdZ
dZd
ZdZdZdZdZdZdZdZdZdZdZdZdZgdef�dedf�dejdf�dedf�e e��e!f�e e��e!j"f�e e	d d �!��e#j$f�e e
d d �!��e#j%f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e&j'f�e e
d d �!��e&j(f�e ed d �!��e#j)f�e ed d �!��e#j)f�e ed d �!��e&j*f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e#f�e ed d �!��e#j$f�d"e+jf�d#e,j%f�d$e-j.f�d%e-j/f�d&e-j0f�d'ed(f�d)ej1d*f�d+e,f�d,efded-fd.ed/fd0efgd1efdejd-fded-fd2ejd/fd3ed/fd"ejfd4efgd5efd"ejfd6efd7efd'ed/fgd8ej1fd"ejfd9ej1fd7ej1fd)ej1d/fgd:�Z2d;S)<rzF
    For the Isabelle proof assistant.

    .. versionadded:: 2.0
    �Isabellezhttps://isabelle.in.tum.de/�isabellez*.thyztext/x-isabelle)2�and�assumes�attach�avoids�binder�checking�class_instance�class_relation�code_module�congs�constant�
constrains�	datatypes�defines�file�fixesr��	functions�hints�
identifierr|�importsry�includes�infix�infixl�infixrr}�keywordsr��module_name�monos�	morphisms�
no_discs_sels�notes�obtains�open�output�
overloaded�
parametric�
permissive�	pervasive�
rep_compat�shows�	structure�
type_class�type_constructor�	unchecked�unsafe�where)L�
ML_command�ML_val�
class_deps�	code_deps�	code_thms�display_drafts�find_consts�
find_theorems�find_unused_assms�full_prf�help�locale_deps�nitpick�pr�prf�
print_abbrevs�print_antiquotations�print_attributes�print_binds�
print_bnfs�
print_bundles�print_case_translations�print_cases�print_claset�
print_classes�print_codeproc�print_codesetup�print_coercions�print_commands�
print_context�print_defn_rules�print_dependencies�print_facts�print_induct_rules�print_inductives�
print_interps�print_locale�
print_locales�
print_methods�
print_options�print_orders�print_quot_maps�print_quotconsts�print_quotients�print_quotientsQ3�print_quotmapsQ3�print_rules�
print_simpset�print_state�print_statement�print_syntax�print_theorems�print_theory�print_trans_rules�prop�pwd�
quickcheck�refute�sledgehammer�
smt_status�solve_direct�spark_status�term�thm�thm_deps�thy_depsr��try0�typ�unused_thms�value�values�welcome�print_ML_antiquotations�print_term_bindings�
values_prolog)�theory�beginrx)�header�chapter)�section�
subsection�
subsubsection�sect�subsect�
subsubsect)��ML�ML_file�abbreviation�adhoc_overloading�arities�	atom_decl�attribute_setup�axiomatization�bundle�
case_of_simps�class�classes�classrel�
codatatype�
code_abort�
code_class�
code_const�
code_datatype�code_identifier�code_include�
code_instance�code_modulename�
code_monad�
code_printing�code_reflect�
code_reserved�	code_type�coinductive�coinductive_set�consts�context�datatype�datatype_new�datatype_new_compat�declaration�declare�default_sort�defer_recdef�
definition�defs�domain�domain_isomorphism�	domaindef�equivariance�export_code�extract�extract_type�fixrecrs�	fun_cases�
hide_class�
hide_const�	hide_fact�	hide_type�import_const_map�import_file�import_tptp�import_type_map�	inductive�
inductive_set�
instantiation�judgment�lemmas�lifting_forget�lifting_update�local_setup�locale�method_setup�nitpick_params�no_adhoc_overloading�no_notation�	no_syntax�no_translations�no_type_notation�nominal_datatype�nonterminal�notation�notepad�oracle�overloading�parse_ast_translation�parse_translation�partial_function�	primcorec�primrec�primrec_new�print_ast_translation�print_translation�quickcheck_generator�quickcheck_params�
realizability�	realizers�recdef�record�
refute_params�setup�
setup_lifting�
simproc_setup�
simps_of_case�sledgehammer_params�	spark_end�
spark_open�spark_open_siv�spark_open_vcg�spark_proof_functions�spark_types�
statespace�syntax�syntax_declarationr�text_raw�theorems�translations�
type_notation�type_synonym�typed_print_translation�typedecl�
hoarestate�install_C_file�install_C_types�	wpc_setup�c_defs�c_types�memsafe�
SML_export�SML_file�
SML_import�approximate�bnf_axiomatization�	cartouche�datatype_compat�free_constructors�functor�nominal_function�nominal_termination�permanent_interpretation�binds�defining�smt2_status�term_cartouche�boogie_file�text_cartouche)�inductive_cases�inductive_simps)!�ax_specification�bnf�	code_pred�	corollary�cpodef�crunch�
crunch_ignore�
enriched_type�function�instance�interpretation�lemma�lift_definition�nominal_inductive�nominal_inductive2�nominal_primrec�pcpodef�primcorecursive�quotient_definition�
quotient_type�	recdef_tc�rep_datatype�schematic_corollary�schematic_lemma�schematic_theorem�spark_vc�
specification�subclass�	sublocale�termination�theorem�typedef�wrap_free_constructors)r�r��qed)�sorry�oops)r��hence�	interpret)�next�proof)�finally�fromr~�
ultimatelyr�)�ML_prf�also�include�	includingr{�moreover�note�txt�txt_raw�	unfoldingr��write)�assumer��defrt�presume)�guess�obtain�show�thus)r��	apply_end�apply_trace�back�defer�prefer)r�r�r��)�[r�r�r�r�r��+r��!�?)�{�}�.z..r�r�r�z\\<open>r9u\{\*|‹r�r�z\\<(\w|\^)*>z'[^\W\d][.\w']*r�rrrrr��factz/[^\s:|\[\]\-()=,+!?{}._][^\s:|\[\]\-()=,+!?{}]*rrr	r
ru[^{*}\\‹›]+z	\\<close>u\*\}|›z[{*}\\]z[^"\\]+z\\"z\\z[^`\\]+z\\`)rr�r9rr�N)3rrrrrrrrr�
keyword_minor�keyword_diag�keyword_thy�keyword_section�keyword_subsection�keyword_theory_decl�keyword_theory_script�keyword_theory_goal�keyword_qed�keyword_abandon_proof�keyword_proof_goal�keyword_proof_block�keyword_proof_chain�keyword_proof_decl�keyword_proof_asm�keyword_proof_asm_goal�keyword_proof_scriptr&�proof_operatorsrrr�Symbolrr�Wordr	r*r�r�Heading�
Subheadingr+�Errorrr
rr.r/r0�Otherr4rrrrr�s���������D�
'�C��l�G��	�I�"�#�I�
�M��L�,-�K�+�O���
$��LC��
��(�K�-��7��+������
D��@�����I�
,�O�.
�
�Z� �.
�
�g�y�)�.
��&�-��5�.
��&�+�.�	.
��U�9�
�
�x�(�
.
��U�?�
#�
#�X�]�3�.
��U�=��u�
=�
=�
=�w�~�N�.
��U�<��e�
<�
<�
<�g�l�K�.
��U�;�u�U�
;�
;�
;�W�E�.
��U�&�u�U�
C�
C�
C�W�M�.
� �U�?�5��
?�
?�
?���Q�!.
�"�U�%�e�E�
B�
B�
B�G�DV�W�#.
�&�U�&�u�U�
C�
C�
C�W�EV�W�'.
�(�U�(��u�
E�
E�
E�w�GX�Y�).
�,�U�(��u�
E�
E�
E�w�}�U�-.
�0�U�;�u�U�
;�
;�
;�W�E�1.
�2�U�%�e�E�
B�
B�
B�G�L�3.
�4�U�&�u�U�
C�
C�
C�W�M�5.
�6�U�%�e�E�
B�
B�
B�G�L�7.
�:�U�&�u�U�
C�
C�
C�W�M�;.
�<�U�$�U�5�
A�
A�
A�7�K�=.
�>�U�)�%��
F�
F�
F��P�?.
�B�U�'��e�
D�
D�
D�g�n�U�C.
�F�d�k�*�G.
�J ���+�K.
�N,�V�Z�8�O.
�P"�6�:�.�Q.
�R ���,�S.
�V�6�8�$�W.
�X�6�<��(�Y.
�Z@��F�[.
�`��!�
�g�w�'�
�g�v�&�
�w��	
� ��(�
�&�-��1�
�&�'�*�
�6�=�&�1�
�&�&�)�
�f�m�,�
�� �
��� �
�f�m�,�
�V��
�F�O�
�6�6�"�
����&�
�f�m�,�
�V�\�"�
�F�L�!�
�6�<��(�
�MM�M�F�F�Frrc��eZdZdZdZdZdgZdgZdgZde	fde
jd	fd
edfdej
fed
dd���ejfeddd���ejfdejfeddd���efeddd���ejfeddd���ejfedd���efed��efdefdejfdejfdejfde
jdfde
jfdejfd ejjfgd!ejfd
ejd"fd#ejd$fd%ejfgd!e
jfd#e
jd$fd%e
jfgd&e
jfd'e
jfde
jd$fgd(�Z d)S)*rzA
    For the Lean theorem prover.

    .. versionadded:: 2.0
    �Leanz"https://github.com/leanprover/lean�leanz*.leanztext/x-leanr�z/--�	docstringz/-r�z--.*?$)�import�renaming�hiding�	namespace�local�private�	protectedr�ru�omitr�r��exportrW�	attributer�r�)(rSrfr~r��example�axiom�axiomsrB�	constants�universe�	universesr�r�r_�extendsr�rQr�znoncomputable theory�
noncomputable�mutual�metar��	parameter�
parameters�variable�	variables�reserve�
precedence�postfixr�rrMrNrOr�r�rx�
set_option�run_cmdz@\[[^\]]*\])rprs�Pirqr�r�r}r�r{r|rr~ryr��calcrwr�)rjr�)�Sortr�r�)z#evalz#checkz#reducez#exitz#printz#help)r�)r�r�r�r�r�r�r�u⟨u⟩u‹u›u⦃u⦄r�r�z�[A-Za-z_\u03b1-\u03ba\u03bc-\u03fb\u1f00-\u1ffe\u2100-\u214f][.A-Za-z_\'\u03b1-\u03ba\u03bc-\u03fb\u1f00-\u1ffe\u2070-\u2079\u207f-\u2089\u2090-\u209c\u2100-\u214f0-9]*z0x[A-Za-z0-9]+z0b[01]+z\d+rrz='(?:(\\[\\\"'nt])|(\\x[0-9a-fA-F]{2})|(\\u[0-9a-fA-F]{4})|.)'rrz[^/-]rz-/r
z[/-]z[^\\"]+z9(?:(\\[\\\"'nt])|(\\x[0-9a-fA-F]{2})|(\\u[0-9a-fA-F]{4})))rr�r�rN)!rrrrrrrrrrr�Docr�Singlerr	r+�Declarationrr�r�rr
rr-r3r2rr)r*�	Multiline�Escaper4rrrrr�sm��������
�D�
.�C��h�G��
�I���I��T�N�
�V�Z��-�
�G�Y�'�
���'�
�U�	��E�	+�	+�	+�-4�,=�	
?��U��0�E�1+�+�+�0-4�,?�1
A�2�W�0�1�
�U���E�	+�+�+�-4�	
5�
�U�%�e�E�
B�
B�
B�G�M�R�
�U�+�E�%�
H�
H�
H�'�,�W�
�U������&�
'��U�����
�=�>B�
D����/�
���(�
�V�^�$�
�6�=�(�+�
M�v�{�[�
!�4�=�1�
�D�L�'�(�AA
�F�w�(�)�
�G�%�w�/�
�G�%�v�.�
�g�'�(�	
��v�z�"�
�F�J��'�
�f�j�!�
����'�
I�6�=�Y�
�&�-��(�
�]S�S�F�F�FrrN)r�pygments.lexerrrr�pygments.tokenrrrr	r
rrr
rr�__all__rrrrrr�<module>r�sX����6�5�5�5�5�5�5�5�5�5�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�-�5�
4�
4��U�U�U�U�U�z�U�U�U�pX�X�X�X�X�J�X�X�X�v_�_�_�_�_�
�_�_�_�_�_r