(path_lemsnil 3507100594"" (skosimp*)"" (lemma "seq_pigeon_hole[T,(vert(GF!1))]" )"" (inst?)"1" (assert )"1" (skosimp*)"1" (inst?)"1" (inst 2 "j!1" )"1" (expand "finseq_appl" )"1" (assert ) nil )))))))))))"2" (skosimp*)"2" (hide 2)"2" (typepred "x1!1" )"2" (typepred "w!1" )"2" (expand "walk?" )"2" (flatten)"2" (expand "verts_in?" )"2" (inst?) nil ))))))))))))))))))))nil )nil graphs nil )"bool" sets nil )nil graphs nil )"[bool, bool -> bool]" booleans nil )nil graphs nil )nil finite_sets nil )nil doubletons nil )"set[T]" doubletons nil )"[T, T -> boolean]" equalities nil )"boolean" notequal nil )AND const-decl "[bool, bool -> bool]" booleans nil )set type-eq-decl nil sets nil )nil booleans nil )nil booleans nil )nil path_lems nil )nil seq_pigeon "structures/" )NOT const-decl "[bool -> bool]" booleans nil )"bool" walks nil )"(strict_total_order?[real])" real_props nil )nil naturalnumbers nil )"[below[length(fs)] -> T]" finite_sequencesnil )nil numbers nil )"[number -> boolean]" number_fieldsnil )nil number_fields nil )"[number_field -> boolean]" reals nil )nil reals nil )"[real -> boolean]" rationals nil )nil rationals nil )"[rational -> boolean]" integers nil )nil integers nil )"bool" reals nil )nil naturalnumbers nil )"bool" reals nil )nil nat_types nil )nil finite_sequences nil )"bool" reals nil )nil walks nil )"bool" walks nil )"Graph[T]" path_lems nil )nil walks nil )"Walk[T](GF!1)" path_lems nil ))nil )))quality 100%
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
