Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
| Download
Try doing some basic maths questions in the Lean Theorem Prover. Functions, real numbers, equivalence relations and groups. Click on README.md and then on "Open in CoCalc with one click".
Project: Xena
Views: 18536License: APACHE
oleanfile 3.4.2, commit cbd2b6686ddb ��V` init � (�export_decl option none none some some export_decl bool ff ff tt tt export_decl has_andthen andthen andthen export_decl has_pow pow pow export_decl has_append append append export_decl decidable is_true is_true is_false is_false to_bool to_bool export_decl has_pure pure pure export_decl has_bind bind bind export_decl has_monad_lift_t monad_lift !monad_lift export_decl monad_functor_t monad_map $monad_map export_decl monad_run run 'run export_decl list mmap *mmap mmap' *mmap' mfilter *mfilter mfoldl *mfoldl export_decl native nat_map 3rb_map mk export_decl name_map native rb_map mk export_decl expr_map native rb_map mk export_decl tactic interaction_monad failed fail export_decl tactic_result interaction_monad result export_decl tactic Ftransparency reducible Greducible semireducible Gsemireducible export_decl tactic mk_simp_attr Lmk_simp_attr export_decl monad_except throw Othrow catch Ocatch export_decl monad_except_adapter adapt_except Tadapt_except export_decl monad_state_adapter adapt_state Wadapt_state export_decl monad_reader read Zread export_decl monad_reader_adapter adapt_reader ]adapt_reader export_decl is_lawful_functor map_const_eq `map_const_eq id_map `id_map comp_map `comp_map export_decl is_lawful_applicative seq_left_eq gseq_left_eq seq_right_eq gseq_right_eq pure_seq_eq_map gpure_seq_eq_map map_pure gmap_pure seq_pure gseq_pure seq_assoc gseq_assoc export_decl is_lawful_monad bind_pure_comp_eq_map tbind_pure_comp_eq_map bind_map_eq_seq tbind_map_eq_seq pure_bind tpure_bind bind_assoc tbind_assoc decl _private ��ϚOcollect_proofs_in _main a expr bool tt � list � prod name tactic � � � prod cases_on � a_fst a_snd id_rhs _a go tac �
monad to_has_bind
interaction_monad monad tactic_state tactic infer_type t mcond
" �is_prop has_orelse orelse
alternative to_has_orelse
tactic alternative �first list map h & ' t' $unit �is_def_eq Ftransparency semireducible bool ff _x A & �target g C �change expr replace a n nat ite eq expr has_decidable_eq V Xoption ( _x Areturn
" prod mk E 9_a � � fst snd C �generalize V H_x A & �intro Eh r u Elist cons x_a list cases_on � � � s name mk_string
Str _x name anonymous list nil hd tl � � V r u � E V � � expr cases_on a R � r u � � level � � a_1 � � � r � a_1 a_2 �
RecFn � v u ( � a_1 a_2 binder_info a_3 � � � u x � � a_1 � �nh $ � E v � V v � a_1 �a_2 a_3 � (nh � �
nh & �mk_local' ( �var �expr instantiate_var � � X V � a_1 �a_2 a_3 � � � � �nh & � � Evar � � E � V � a_1 a_2 a_3 � (nh � � � � nh � � ? � 1 nh � � X � macro_def a_1 � �nh 2
" x e � � V V ( � PInfo � prv collect_proofs_in _main �VMR �_rec_1 VMR �_lambda_1 VMR �_lambda_2 VMR �_lambda_3 VMR �_lambda_4 VMR �_lambda_5 VMR �_lambda_6 VMR �_lambda_7 VMR �_lambda_8 VMR �_lambda_9 VMR �_lambda_10 VMR �_lambda_11 VMR �_lambda_12 VMR �_lambda_13 VMR �_lambda_14 VMR �_lambda_15 VMR �_lambda_16 VMR �_lambda_17 VMR �_rec_2 VMR �_lambda_18 VMR �_lambda_19 VMR �_lambda_20 VMR �_lambda_21 VMR �_lambda_22 VMR �VMC � n list cases_on name anonymous xchar of_nat _ � string empty string str � name mk_string VMC � α VMC � � R � _fresh
� | � _fresh
� o expr has_decidable_eq VMC �9s ! � � _fresh
� y � _fresh
� r � _fresh
� q � & tactic infer_type 3 tactic is_def_eq , tactic target % �
expr replace tactic change
#
*
1
VMC �$ a ! � / � 2 � & � tactic generalize Fintro
"VMC � � s ! � / � 2 VMC � � R � � _fresh
� � � & � ( VMC � 9 � ) ! � � _fresh
� � � / � 2 � & � 4 3 � 6 , � 8 % �
� : � <
#
*
1
VMC � � ) ! � _fresh
� � � _fresh
� � � / � 2 � _fresh
� p � �VMC � � R � � _fresh
� � � & � ( VMC � 9 � ) ! � � _fresh
� � � / � 2 � & � 4 3 � 6 , � 8 % �
� : � <
#
*
1
VMC � & � ) ! � _fresh
� � � _fresh
� � � _fresh
� � � � _fresh
� � � / � 2 � P � Fmk_local'
expr instantiate_var �
VMC � � R � � _fresh
� � & � ( VMC � 9 � ) ! � � _fresh
� � / � 2 � & � 4 3 � 6 , � 8 % �
� : � <
#
*
1
VMC � $ � ) ! � _fresh
� � _fresh
� � _fresh
� � / � 2 � P � �
� e �
VMC � � R � � _fresh
� C � & � ( VMC �
9 � ) ! � � _fresh
� A � / � 2 � & � 4 3 � 6 , � 8 % �
� : � <
#
*
1
VMC � 2 � � � P �VMC � � T � = !n � _fresh
�
� � _fresh
�
� � _fresh
�
� � _fresh
�
� expr cases_on
AJS���� � 4 : � �
_c_1
� interaction_monad_orelse � list map _main Ffirst _main � � Fis_prop � � mcond ?
� � � 4 W� � � � � � � � � � � � � � � � � � � ��
� 4 �� � � � � � �
� � � � � � �
� � � � � ��
� �� � c ��
� e ��
�
� 4 �� � � � � � �
� � � � � � �
� � � � � ��
� 4 � � M �
_c_2 �
� list mfoldl _main � � � � � �
� � � � � � � �
� � �� R
VMC �
� R � � _fresh
� l � _fresh
� b � ( VMC � 9 � ) ! � � _fresh
� j � _fresh
� g � _fresh
� f � � � 4 3 � 6 , � 8 % �
� : � <
#
*
1
VMC � $ � = ! � � � � � � � � ? � @
"VMC � � A ! � � � � VMC � 2 � ) ! � � � � � � � � 4 , � � � � � � � � � � � � � � � � �VMC � � = ! � � � � prv � decl � � PInfo VMR VMC � decl �generalize_proofs ns
A � � � t $ A �intros_dep _x � x � w �local_context 0
" �is_proof hs % A Mt has_bind and_then A
# � � V �skip
� PInfo � �6 VMR � �_lambda_1 VMR � �VMC � �6 � VMC � �A6 � ) ! � � Fintros_dep _main ;tactic local_context Fis_proof � � � list mfilter _main 4 � 8 - � "& tactic skip +
29decl �interactive generalize_proofs � interactive parse a list reflect � � name reflect
Quote lean parser many lean parser � �parser_state � �alternative � �types ident_ � t � utactic generalize_proofs � PInfo � �A VMR � � VMC � � A � � doc � �Generalize proofs in the goal, naming them with the provided list. EndFile