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".
License: APACHE
oleanfile 3.4.2, commit cbd2b6686ddb ��S"� init data rat order data rat cast algebra floor � @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 export_decl traversable traverse }traverse decl rat floor _main a rat int � rat cases_on � a_num a_denom nat a_pos has_lt lt nat has_lt has_zero zero nat has_zero a_cop nat coprime �nat_abs id_rhs has_div div int has_div coe coe_to_lift coe_base int has_coe � PInfo �VMR �VMC � � int of_nat �div _main decl �equations _eqn_1 n d h c eq � �mk' 0 � � � � eq refl id_delta @� PInfo �ATTR _refl_lemma � � � EqnL �decl �floor : � PInfo �prt �VMR � VMC � � doc �`floor q` is the largest integer `z` such that `z ≤ q` decl �equations _eqn_1 � � � � 9 � ? 0 �equations _eqn_1 � PInfo �ATTR �� � � EqnL �decl �_sunfold 7 � PInfo �decl �le_floor z r iff has_le le int has_le Q [ rat has_le " % ( int cast_coe rat has_neg �has_zero �has_one �has_add � � � � Z ^ ` e x r_num r_denom r_pos r_cop � Z ^ R e x � ?eq mpr � Z � 0 �id 8 � �a � � �e_1 � b � � �e_2 �congr � � Z � Z congr_arg � � � � � � Z � �c has_le a � e_2 9 � � e_3 � � � \ � � � � � � � � � ] � � H � R 0 � � � G � � � � � �rat mk / � � � �eq rec ?_a � Z ^ � � . e x � ; � � � � � � �num_denom' � � � ^has_mul mul �has_mul � / � � � � & � � � � � � � %eq trans � � e � �has_one one �has_one � � % � �_a � � � � � e � @ � � � 9 �coe_int_eq_mk � � � � ; � % � 2 � ; � $ � ! � 6monoid to_has_one semiring to_monoid ordered_semiring to_semiring linear_ordered_semiring to_ordered_semiring linear_ordered_ring to_linear_ordered_semiring linear_ordered_comm_ring to_linear_ordered_ring decidable_linear_ordered_comm_ring to_linear_ordered_comm_ring �decidable_linear_ordered_comm_ring � % � � e � 4 � j �_a � � e � � � 8 � @ � � ; � lpropext � r � lrat le_def � � j /zero_lt_one � e �mpr �has_lt . / �coe_nat_lt � � � l � % � 2 � l � % � % � � semigroup to_has_mul �to_semigroup �monoid � 6 � U � �_a � ^ � ! � � � ! � � j � � � � l mul_one � � � � � % � % � � %int le_div_iff_mul_le � / � �� PInfo �prt �decl �floor_ring floor_ring �linear_ordered_ring floor_ring mk � � Qrat le_floor � PInfo � % prt � VMR � VMC � % �decl � equations _eqn_1 8 � � � � � G � � � �� PInfo � % ATTR �� � � EqnL � SEqnL � ATTR instance � � � class � � � �decl �floor_def q 9floor � � � � �num . �denom � � � q_num q_denom q_pos q_cop H � � ?� PInfo � (prt � EndFile