src/Pure/Pure.thy
author wenzelm
Wed Jul 08 15:37:32 2015 +0200 (2015-07-08)
changeset 60694 b3fa4a8cdb5f
parent 60624 5b6552e12421
child 60749 f727b99faaf7
permissions -rw-r--r--
clarified text folds: proof ... qed counts as extra block;
wenzelm@48929
     1
(*  Title:      Pure/Pure.thy
wenzelm@48929
     2
    Author:     Makarius
wenzelm@48929
     3
wenzelm@48929
     4
Final stage of bootstrapping Pure, based on implicit background theory.
wenzelm@48929
     5
*)
wenzelm@48929
     6
wenzelm@48638
     7
theory Pure
wenzelm@48641
     8
  keywords
wenzelm@58928
     9
    "!!" "!" "+" "--" ":" ";" "<" "<=" "=" "=>" "?" "[" "\<equiv>"
wenzelm@58928
    10
    "\<leftharpoondown>" "\<rightharpoonup>" "\<rightleftharpoons>"
wenzelm@58928
    11
    "\<subseteq>" "]" "assumes" "attach" "binder" "constrains"
wenzelm@58928
    12
    "defines" "fixes" "for" "identifier" "if" "in" "includes" "infix"
wenzelm@58928
    13
    "infixl" "infixr" "is" "notes" "obtains" "open" "output"
wenzelm@60623
    14
    "overloaded" "pervasive" "premises" "private" "qualified" "shows"
wenzelm@60555
    15
    "structure" "unchecked" "where" "when" "|"
wenzelm@58999
    16
  and "text" "txt" :: document_body
wenzelm@58999
    17
  and "text_raw" :: document_raw
wenzelm@57506
    18
  and "default_sort" :: thy_decl == ""
wenzelm@57506
    19
  and "typedecl" "type_synonym" "nonterminal" "judgment"
wenzelm@55385
    20
    "consts" "syntax" "no_syntax" "translations" "no_translations" "defs"
wenzelm@55385
    21
    "definition" "abbreviation" "type_notation" "no_type_notation" "notation"
wenzelm@48641
    22
    "no_notation" "axiomatization" "theorems" "lemmas" "declare"
wenzelm@48641
    23
    "hide_class" "hide_type" "hide_const" "hide_fact" :: thy_decl
wenzelm@58918
    24
  and "SML_file" :: thy_load % "ML"
wenzelm@56618
    25
  and "SML_import" "SML_export" :: thy_decl % "ML"
wenzelm@51295
    26
  and "ML" :: thy_decl % "ML"
wenzelm@48641
    27
  and "ML_prf" :: prf_decl % "proof"  (* FIXME % "ML" ?? *)
wenzelm@48641
    28
  and "ML_val" "ML_command" :: diag % "ML"
wenzelm@55762
    29
  and "simproc_setup" :: thy_decl % "ML" == ""
wenzelm@48641
    30
  and "setup" "local_setup" "attribute_setup" "method_setup"
wenzelm@55762
    31
    "declaration" "syntax_declaration"
wenzelm@48641
    32
    "parse_ast_translation" "parse_translation" "print_translation"
wenzelm@48641
    33
    "typed_print_translation" "print_ast_translation" "oracle" :: thy_decl % "ML"
wenzelm@48641
    34
  and "bundle" :: thy_decl
wenzelm@48641
    35
  and "include" "including" :: prf_decl
wenzelm@48641
    36
  and "print_bundles" :: diag
wenzelm@59901
    37
  and "context" "locale" "experiment" :: thy_decl_block
wenzelm@51224
    38
  and "sublocale" "interpretation" :: thy_goal
wenzelm@51224
    39
  and "interpret" :: prf_goal % "proof"
wenzelm@58800
    40
  and "class" :: thy_decl_block
wenzelm@48641
    41
  and "subclass" :: thy_goal
wenzelm@58800
    42
  and "instantiation" :: thy_decl_block
wenzelm@48641
    43
  and "instance" :: thy_goal
wenzelm@58800
    44
  and "overloading" :: thy_decl_block
wenzelm@48641
    45
  and "code_datatype" :: thy_decl
wenzelm@48641
    46
  and "theorem" "lemma" "corollary" :: thy_goal
wenzelm@51274
    47
  and "schematic_theorem" "schematic_lemma" "schematic_corollary" :: thy_goal
wenzelm@58800
    48
  and "notepad" :: thy_decl_block
wenzelm@50128
    49
  and "have" :: prf_goal % "proof"
wenzelm@50128
    50
  and "hence" :: prf_goal % "proof" == "then have"
wenzelm@50128
    51
  and "show" :: prf_asm_goal % "proof"
wenzelm@50128
    52
  and "thus" :: prf_asm_goal % "proof" == "then show"
wenzelm@48641
    53
  and "then" "from" "with" :: prf_chain % "proof"
wenzelm@60371
    54
  and "note" :: prf_decl % "proof"
wenzelm@60371
    55
  and "supply" :: prf_script % "proof"
wenzelm@60371
    56
  and "using" "unfolding" :: prf_decl % "proof"
wenzelm@48641
    57
  and "fix" "assume" "presume" "def" :: prf_asm % "proof"
wenzelm@60448
    58
  and "consider" :: prf_goal % "proof"
wenzelm@53371
    59
  and "obtain" :: prf_asm_goal % "proof"
wenzelm@60624
    60
  and "guess" :: prf_script_asm_goal % "proof"
wenzelm@48641
    61
  and "let" "write" :: prf_decl % "proof"
wenzelm@48641
    62
  and "case" :: prf_asm % "proof"
wenzelm@48641
    63
  and "{" :: prf_open % "proof"
wenzelm@48641
    64
  and "}" :: prf_close % "proof"
wenzelm@60694
    65
  and "next" :: next_block % "proof"
wenzelm@48641
    66
  and "qed" :: qed_block % "proof"
wenzelm@53571
    67
  and "by" ".." "." "sorry" :: "qed" % "proof"
wenzelm@53571
    68
  and "done" :: "qed_script" % "proof"
wenzelm@48641
    69
  and "oops" :: qed_global % "proof"
wenzelm@50128
    70
  and "defer" "prefer" "apply" :: prf_script % "proof"
wenzelm@50128
    71
  and "apply_end" :: prf_script % "proof" == ""
wenzelm@60624
    72
  and "subgoal" :: prf_script_goal % "proof"
wenzelm@48641
    73
  and "proof" :: prf_block % "proof"
wenzelm@48641
    74
  and "also" "moreover" :: prf_decl % "proof"
wenzelm@48641
    75
  and "finally" "ultimately" :: prf_chain % "proof"
wenzelm@48641
    76
  and "back" :: prf_script % "proof"
wenzelm@56069
    77
  and "help" "print_commands" "print_options" "print_context"
wenzelm@56069
    78
    "print_theory" "print_syntax" "print_abbrevs" "print_defn_rules"
wenzelm@48641
    79
    "print_theorems" "print_locales" "print_classes" "print_locale"
wenzelm@48641
    80
    "print_interps" "print_dependencies" "print_attributes"
wenzelm@48641
    81
    "print_simpset" "print_rules" "print_trans_rules" "print_methods"
wenzelm@56069
    82
    "print_antiquotations" "print_ML_antiquotations" "thy_deps"
wenzelm@58845
    83
    "locale_deps" "class_deps" "thm_deps" "print_term_bindings"
wenzelm@57415
    84
    "print_facts" "print_cases" "print_statement" "thm" "prf" "full_prf"
wenzelm@57415
    85
    "prop" "term" "typ" "print_codesetup" "unused_thms" :: diag
wenzelm@58845
    86
  and "display_drafts" "print_state" :: diag
wenzelm@48646
    87
  and "welcome" :: diag
wenzelm@48641
    88
  and "end" :: thy_end % "theory"
wenzelm@56797
    89
  and "realizers" :: thy_decl == ""
wenzelm@56797
    90
  and "realizability" :: thy_decl == ""
wenzelm@56797
    91
  and "extract_type" "extract" :: thy_decl
wenzelm@48646
    92
  and "find_theorems" "find_consts" :: diag
wenzelm@57886
    93
  and "named_theorems" :: thy_decl
wenzelm@48638
    94
begin
wenzelm@15803
    95
wenzelm@56205
    96
ML_file "ML/ml_antiquotations.ML"
wenzelm@55516
    97
ML_file "ML/ml_thms.ML"
wenzelm@56864
    98
ML_file "Tools/print_operation.ML"
wenzelm@48891
    99
ML_file "Isar/isar_syn.ML"
wenzelm@55141
   100
ML_file "Isar/calculation.ML"
wenzelm@58544
   101
ML_file "Tools/bibtex.ML"
wenzelm@55030
   102
ML_file "Tools/rail.ML"
wenzelm@58860
   103
ML_file "Tools/rule_insts.ML"
wenzelm@58860
   104
ML_file "Tools/thm_deps.ML"
wenzelm@60093
   105
ML_file "Tools/thy_deps.ML"
haftmann@58201
   106
ML_file "Tools/class_deps.ML"
wenzelm@48891
   107
ML_file "Tools/find_theorems.ML"
wenzelm@48891
   108
ML_file "Tools/find_consts.ML"
wenzelm@54730
   109
ML_file "Tools/simplifier_trace.ML"
wenzelm@57886
   110
ML_file "Tools/named_theorems.ML"
wenzelm@48891
   111
wenzelm@48891
   112
wenzelm@58611
   113
section \<open>Basic attributes\<close>
wenzelm@55140
   114
wenzelm@55140
   115
attribute_setup tagged =
wenzelm@58611
   116
  \<open>Scan.lift (Args.name -- Args.name) >> Thm.tag\<close>
wenzelm@55140
   117
  "tagged theorem"
wenzelm@55140
   118
wenzelm@55140
   119
attribute_setup untagged =
wenzelm@58611
   120
  \<open>Scan.lift Args.name >> Thm.untag\<close>
wenzelm@55140
   121
  "untagged theorem"
wenzelm@55140
   122
wenzelm@55140
   123
attribute_setup kind =
wenzelm@58611
   124
  \<open>Scan.lift Args.name >> Thm.kind\<close>
wenzelm@55140
   125
  "theorem kind"
wenzelm@55140
   126
wenzelm@55140
   127
attribute_setup THEN =
wenzelm@58611
   128
  \<open>Scan.lift (Scan.optional (Args.bracks Parse.nat) 1) -- Attrib.thm
wenzelm@58611
   129
    >> (fn (i, B) => Thm.rule_attribute (fn _ => fn A => A RSN (i, B)))\<close>
wenzelm@55140
   130
  "resolution with rule"
wenzelm@55140
   131
wenzelm@55140
   132
attribute_setup OF =
wenzelm@58611
   133
  \<open>Attrib.thms >> (fn Bs => Thm.rule_attribute (fn _ => fn A => A OF Bs))\<close>
wenzelm@55140
   134
  "rule resolved with facts"
wenzelm@55140
   135
wenzelm@55140
   136
attribute_setup rename_abs =
wenzelm@58611
   137
  \<open>Scan.lift (Scan.repeat (Args.maybe Args.name)) >> (fn vs =>
wenzelm@58611
   138
    Thm.rule_attribute (K (Drule.rename_bvars' vs)))\<close>
wenzelm@55140
   139
  "rename bound variables in abstractions"
wenzelm@55140
   140
wenzelm@55140
   141
attribute_setup unfolded =
wenzelm@58611
   142
  \<open>Attrib.thms >> (fn ths =>
wenzelm@58611
   143
    Thm.rule_attribute (fn context => Local_Defs.unfold (Context.proof_of context) ths))\<close>
wenzelm@55140
   144
  "unfolded definitions"
wenzelm@55140
   145
wenzelm@55140
   146
attribute_setup folded =
wenzelm@58611
   147
  \<open>Attrib.thms >> (fn ths =>
wenzelm@58611
   148
    Thm.rule_attribute (fn context => Local_Defs.fold (Context.proof_of context) ths))\<close>
wenzelm@55140
   149
  "folded definitions"
wenzelm@55140
   150
wenzelm@55140
   151
attribute_setup consumes =
wenzelm@58611
   152
  \<open>Scan.lift (Scan.optional Parse.int 1) >> Rule_Cases.consumes\<close>
wenzelm@55140
   153
  "number of consumed facts"
wenzelm@55140
   154
wenzelm@55140
   155
attribute_setup constraints =
wenzelm@58611
   156
  \<open>Scan.lift Parse.nat >> Rule_Cases.constraints\<close>
wenzelm@55140
   157
  "number of equality constraints"
wenzelm@55140
   158
wenzelm@58611
   159
attribute_setup case_names =
wenzelm@58611
   160
  \<open>Scan.lift (Scan.repeat1 (Args.name --
wenzelm@55140
   161
    Scan.optional (@{keyword "["} |-- Scan.repeat1 (Args.maybe Args.name) --| @{keyword "]"}) []))
wenzelm@58611
   162
    >> (fn cs =>
wenzelm@55140
   163
      Rule_Cases.cases_hyp_names
wenzelm@55140
   164
        (map #1 cs)
wenzelm@58611
   165
        (map (map (the_default Rule_Cases.case_hypsN) o #2) cs))\<close>
wenzelm@58611
   166
  "named rule cases"
wenzelm@55140
   167
wenzelm@55140
   168
attribute_setup case_conclusion =
wenzelm@58611
   169
  \<open>Scan.lift (Args.name -- Scan.repeat Args.name) >> Rule_Cases.case_conclusion\<close>
wenzelm@55140
   170
  "named conclusion of rule cases"
wenzelm@55140
   171
wenzelm@55140
   172
attribute_setup params =
wenzelm@58611
   173
  \<open>Scan.lift (Parse.and_list1 (Scan.repeat Args.name)) >> Rule_Cases.params\<close>
wenzelm@55140
   174
  "named rule parameters"
wenzelm@55140
   175
wenzelm@58611
   176
attribute_setup rule_format =
wenzelm@58611
   177
  \<open>Scan.lift (Args.mode "no_asm")
wenzelm@58611
   178
    >> (fn true => Object_Logic.rule_format_no_asm | false => Object_Logic.rule_format)\<close>
wenzelm@58611
   179
  "result put into canonical rule format"
wenzelm@55140
   180
wenzelm@55140
   181
attribute_setup elim_format =
wenzelm@58611
   182
  \<open>Scan.succeed (Thm.rule_attribute (K Tactic.make_elim))\<close>
wenzelm@55140
   183
  "destruct rule turned into elimination rule format"
wenzelm@55140
   184
wenzelm@58611
   185
attribute_setup no_vars =
wenzelm@58611
   186
  \<open>Scan.succeed (Thm.rule_attribute (fn context => fn th =>
wenzelm@55140
   187
    let
wenzelm@55140
   188
      val ctxt = Variable.set_body false (Context.proof_of context);
wenzelm@55140
   189
      val ((_, [th']), _) = Variable.import true [th] ctxt;
wenzelm@58611
   190
    in th' end))\<close>
wenzelm@58611
   191
  "imported schematic variables"
wenzelm@55140
   192
wenzelm@55140
   193
attribute_setup atomize =
wenzelm@58611
   194
  \<open>Scan.succeed Object_Logic.declare_atomize\<close>
wenzelm@55140
   195
  "declaration of atomize rule"
wenzelm@55140
   196
wenzelm@55140
   197
attribute_setup rulify =
wenzelm@58611
   198
  \<open>Scan.succeed Object_Logic.declare_rulify\<close>
wenzelm@55140
   199
  "declaration of rulify rule"
wenzelm@55140
   200
wenzelm@55140
   201
attribute_setup rotated =
wenzelm@58611
   202
  \<open>Scan.lift (Scan.optional Parse.int 1
wenzelm@58611
   203
    >> (fn n => Thm.rule_attribute (fn _ => rotate_prems n)))\<close>
wenzelm@55140
   204
  "rotated theorem premises"
wenzelm@55140
   205
wenzelm@55140
   206
attribute_setup defn =
wenzelm@58611
   207
  \<open>Attrib.add_del Local_Defs.defn_add Local_Defs.defn_del\<close>
wenzelm@55140
   208
  "declaration of definitional transformations"
wenzelm@55140
   209
wenzelm@55140
   210
attribute_setup abs_def =
wenzelm@58611
   211
  \<open>Scan.succeed (Thm.rule_attribute (fn context =>
wenzelm@58611
   212
    Local_Defs.meta_rewrite_rule (Context.proof_of context) #> Drule.abs_def))\<close>
wenzelm@55140
   213
  "abstract over free variables of definitional theorem"
wenzelm@55140
   214
wenzelm@55140
   215
wenzelm@58611
   216
section \<open>Further content for the Pure theory\<close>
wenzelm@20627
   217
wenzelm@58611
   218
subsection \<open>Meta-level connectives in assumptions\<close>
wenzelm@15803
   219
wenzelm@15803
   220
lemma meta_mp:
wenzelm@58612
   221
  assumes "PROP P \<Longrightarrow> PROP Q" and "PROP P"
wenzelm@15803
   222
  shows "PROP Q"
wenzelm@58612
   223
    by (rule \<open>PROP P \<Longrightarrow> PROP Q\<close> [OF \<open>PROP P\<close>])
wenzelm@15803
   224
nipkow@23432
   225
lemmas meta_impE = meta_mp [elim_format]
nipkow@23432
   226
wenzelm@15803
   227
lemma meta_spec:
wenzelm@58612
   228
  assumes "\<And>x. PROP P x"
wenzelm@26958
   229
  shows "PROP P x"
wenzelm@58612
   230
    by (rule \<open>\<And>x. PROP P x\<close>)
wenzelm@15803
   231
wenzelm@15803
   232
lemmas meta_allE = meta_spec [elim_format]
wenzelm@15803
   233
wenzelm@26570
   234
lemma swap_params:
wenzelm@58612
   235
  "(\<And>x y. PROP P x y) \<equiv> (\<And>y x. PROP P x y)" ..
wenzelm@26570
   236
wenzelm@18466
   237
wenzelm@58611
   238
subsection \<open>Meta-level conjunction\<close>
wenzelm@18466
   239
wenzelm@18466
   240
lemma all_conjunction:
wenzelm@58612
   241
  "(\<And>x. PROP A x &&& PROP B x) \<equiv> ((\<And>x. PROP A x) &&& (\<And>x. PROP B x))"
wenzelm@18466
   242
proof
wenzelm@58612
   243
  assume conj: "\<And>x. PROP A x &&& PROP B x"
wenzelm@58612
   244
  show "(\<And>x. PROP A x) &&& (\<And>x. PROP B x)"
wenzelm@19121
   245
  proof -
wenzelm@18466
   246
    fix x
wenzelm@26958
   247
    from conj show "PROP A x" by (rule conjunctionD1)
wenzelm@26958
   248
    from conj show "PROP B x" by (rule conjunctionD2)
wenzelm@18466
   249
  qed
wenzelm@18466
   250
next
wenzelm@58612
   251
  assume conj: "(\<And>x. PROP A x) &&& (\<And>x. PROP B x)"
wenzelm@18466
   252
  fix x
wenzelm@28856
   253
  show "PROP A x &&& PROP B x"
wenzelm@19121
   254
  proof -
wenzelm@26958
   255
    show "PROP A x" by (rule conj [THEN conjunctionD1, rule_format])
wenzelm@26958
   256
    show "PROP B x" by (rule conj [THEN conjunctionD2, rule_format])
wenzelm@18466
   257
  qed
wenzelm@18466
   258
qed
wenzelm@18466
   259
wenzelm@19121
   260
lemma imp_conjunction:
wenzelm@58612
   261
  "(PROP A \<Longrightarrow> PROP B &&& PROP C) \<equiv> ((PROP A \<Longrightarrow> PROP B) &&& (PROP A \<Longrightarrow> PROP C))"
wenzelm@18836
   262
proof
wenzelm@58612
   263
  assume conj: "PROP A \<Longrightarrow> PROP B &&& PROP C"
wenzelm@58612
   264
  show "(PROP A \<Longrightarrow> PROP B) &&& (PROP A \<Longrightarrow> PROP C)"
wenzelm@19121
   265
  proof -
wenzelm@18466
   266
    assume "PROP A"
wenzelm@58611
   267
    from conj [OF \<open>PROP A\<close>] show "PROP B" by (rule conjunctionD1)
wenzelm@58611
   268
    from conj [OF \<open>PROP A\<close>] show "PROP C" by (rule conjunctionD2)
wenzelm@18466
   269
  qed
wenzelm@18466
   270
next
wenzelm@58612
   271
  assume conj: "(PROP A \<Longrightarrow> PROP B) &&& (PROP A \<Longrightarrow> PROP C)"
wenzelm@18466
   272
  assume "PROP A"
wenzelm@28856
   273
  show "PROP B &&& PROP C"
wenzelm@19121
   274
  proof -
wenzelm@58611
   275
    from \<open>PROP A\<close> show "PROP B" by (rule conj [THEN conjunctionD1])
wenzelm@58611
   276
    from \<open>PROP A\<close> show "PROP C" by (rule conj [THEN conjunctionD2])
wenzelm@18466
   277
  qed
wenzelm@18466
   278
qed
wenzelm@18466
   279
wenzelm@18466
   280
lemma conjunction_imp:
wenzelm@58612
   281
  "(PROP A &&& PROP B \<Longrightarrow> PROP C) \<equiv> (PROP A \<Longrightarrow> PROP B \<Longrightarrow> PROP C)"
wenzelm@18466
   282
proof
wenzelm@58612
   283
  assume r: "PROP A &&& PROP B \<Longrightarrow> PROP C"
wenzelm@22933
   284
  assume ab: "PROP A" "PROP B"
wenzelm@22933
   285
  show "PROP C"
wenzelm@22933
   286
  proof (rule r)
wenzelm@28856
   287
    from ab show "PROP A &&& PROP B" .
wenzelm@22933
   288
  qed
wenzelm@18466
   289
next
wenzelm@58612
   290
  assume r: "PROP A \<Longrightarrow> PROP B \<Longrightarrow> PROP C"
wenzelm@28856
   291
  assume conj: "PROP A &&& PROP B"
wenzelm@18466
   292
  show "PROP C"
wenzelm@18466
   293
  proof (rule r)
wenzelm@19121
   294
    from conj show "PROP A" by (rule conjunctionD1)
wenzelm@19121
   295
    from conj show "PROP B" by (rule conjunctionD2)
wenzelm@18466
   296
  qed
wenzelm@18466
   297
qed
wenzelm@18466
   298
wenzelm@48638
   299
end
wenzelm@48638
   300