# Theory LocaleTest

Up to index of Isabelle/FOL/ex

theory LocaleTest
imports FOL
begin

    (*  Title:      FOL/ex/LocaleTest.thy
        ID:         $Id: LocaleTest.thy,v 1.17 2005/09/16 12:48:13 ballarin Exp $
        Author:     Clemens Ballarin
        Copyright (c) 2005 by Clemens Ballarin

    Collection of regression tests for locales.
    *)

    header {* Test of Locale Interpretation *}

    theory LocaleTest
    imports FOL
    begin

    ML {* set quick_and_dirty *}    (* allow for thm command in batch mode *)
    ML {* set Toplevel.debug *}
    ML {* set show_hyps *}
    ML {* set show_sorts *}

    ML {*
      fun check_thm name = let
        val thy = the_context ();
        val thm = get_thm thy (Name name);
        val {prop, hyps, ...} = rep_thm thm;
        val prems = Logic.strip_imp_prems prop;
        val _ = if null hyps then ()
            else error ("Theorem " ^ quote name ^ " has meta hyps.\n" ^
              "Consistency check of locales package failed.");
        val _ = if null prems then ()
            else error ("Theorem " ^ quote name ^ " has premises.\n" ^
              "Consistency check of locales package failed.");
      in () end;
    *}

    section {* Context Elements and Locale Expressions *}

    text {* Naming convention for global objects: prefixes L and l *}

    subsection {* Renaming with Syntax *}

    locale (open) LS = var mult +
      assumes "mult(x, y) = mult(y, x)"

    print_locale LS

    locale LS' = LS mult (infixl "**" 60)

    print_locale LS'

    locale LT = var mult (infixl "**" 60) +
      assumes "x ** y = y ** x"

    locale LU = LT mult (infixl "**" 60) + LT add (infixl "++" 55) + var h +
      assumes hom: "h(x ** y) = h(x) ++ h(y)"

    locale LV = LU _ add

    subsection {* Constrains *}

    locale LZ = fixes a (structure)
    locale LZ' = LZ +
      constrains a :: "'a => 'b"
      assumes "a (x :: 'a) = a (y)"
    print_locale LZ'

    section {* Interpretation *}

    text {* Naming convention for global objects: prefixes I and i *}

    text {* interpretation input syntax *}

    locale IL
    locale IM = fixes a and b and c

    interpretation test [simp]: IL + IM a b c [x y z] .

    print_interps IL    (* output: test *)
    print_interps IM    (* output: test *)

    interpretation test [simp]: IL print_interps IM .

    interpretation IL .

    text {* Processing of locale expression *}

    locale IA = fixes a assumes asm_A: "a = a"

    locale (open) IB = fixes b assumes asm_B [simp]: "b = b"

    locale IC = IA + IB + assumes asm_C: "c = c"
      (* TODO: independent type var in c, prohibit locale declaration *)

    locale ID = IA + IB + fixes d defines def_D: "d == (a = b)"

    theorem (in IA)
      includes ID
      shows True ..

    theorem (in ID) True ..

    typedecl i
    arities i :: "term"

    interpretation i1: IC ["X::i" "Y::i"] by (auto intro: IA.intro IC_axioms.intro)

    print_interps IA  (* output: i1 *)

    (* possible accesses *)
    thm i1.a.asm_A thm LocaleTest.i1.a.asm_A
    thm i1.asm_A thm LocaleTest.i1.asm_A

    ML {* check_thm "i1.a.asm_A" *}

    (* without prefix *)

    interpretation IC ["W::i" "Z::i"] .  (* subsumed by i1: IC *)
    interpretation IC ["W::'a" "Z::i"] by (auto intro: IA.intro IC_axioms.intro)
      (* subsumes i1: IA and i1: IC *)

    print_interps IA  (* output: <no prefix>, i1 *)

    (* possible accesses *)
    thm asm_C thm a_b.asm_C thm LocaleTest.a_b.asm_C thm LocaleTest.a_b.asm_C

    ML {* check_thm "asm_C" *}

    interpretation i2: ID [X "Y::i" "Y = X"] by (simp add: eq_commute)

    print_interps IA  (* output: <no prefix>, i1 *)
    print_interps ID  (* output: i2 *)

    interpretation i3: ID [X "Y::i"] .

    (* duplicate: thm not added *)

    (* thm i3.a.asm_A *)

    print_interps IA  (* output: <no prefix>, i1 *)
    print_interps IB  (* output: i1 *)
    print_interps IC  (* output: <no prefix, i1 *)
    print_interps ID  (* output: i2, i3 *)

    (* schematic vars in instantiation not permitted *)
    (*
    interpretation i4: IA ["?x::?'a1"] apply (rule IA.intro) apply rule done
    print_interps IA
    *)

    interpretation i10: ID + ID a' b' d' [X "Y::i" _ u "v::i" _] .

    corollary (in ID) th_x: True ..

    (* possible accesses: for each registration *)

    thm i2.th_x thm i3.th_x

    ML {* check_thm "i2.th_x"; check_thm "i3.th_x" *}

    lemma (in ID) th_y: "d == (a = b)" .

    thm i2.th_y thm i3.th_y

    ML {* check_thm "i2.th_y"; check_thm "i3.th_y" *}

    lemmas (in ID) th_z = th_y

    thm i2.th_z

    ML {* check_thm "i2.th_z" *}

    subsection {* Interpretation in Proof Contexts *}

    locale IF = fixes f assumes asm_F: "f & f --> f"

    theorem True
    proof -
      fix alpha::i and beta::'a and gamma::o
      (* FIXME: omitting type of beta leads to error later at interpret i6 *)
      have alpha_A: "IA(alpha)" by (auto intro: IA.intro)
      interpret i5: IA [alpha] .  (* subsumed *)
      print_interps IA  (* output: <no prefix>, i1 *)
      interpret i6: IC [alpha beta] by (auto intro: IC_axioms.intro)
      print_interps IA   (* output: <no prefix>, i1 *)
      print_interps IC   (* output: <no prefix>, i1, i6 *)
      interpret i11: IF [gamma] by (fast intro: IF.intro)
      thm i11.asm_F      (* gamma is a Free *)
    qed rule

    theorem (in IA) True
    proof -
      print_interps IA
      fix beta and gamma
      interpret i9: ID [a beta _]
        (* no proof obligation for IA !!! *)
        apply - apply (rule refl) apply assumption done
    qed rule

    (* Definition involving free variable *)

    ML {* reset show_sorts *}

    locale IE = fixes e defines e_def: "e(x) == x & x"
      notes e_def2 = e_def

    lemma (in IE) True thm e_def by fast

    interpretation i7: IE ["%x. x"] by simp

    thm i7.e_def2 (* has no premise *)

    ML {* check_thm "i7.e_def2" *}

    locale IE' = fixes e defines e_def: "e == (%x. x & x)"
      notes e_def2 = e_def

    interpretation i7': IE' ["(%x. x)"] by simp

    thm i7'.e_def2

    ML {* check_thm "i7'.e_def2" *}

    (* Definition involving free variable in assm *)

    locale (open) IG = fixes g assumes asm_G: "g --> x"
      notes asm_G2 = asm_G

    interpretation i8: IG ["False"] by fast

    thm i8.asm_G2

    ML {* check_thm "i8.asm_G2" *}

    text {* Locale without assumptions *}

    locale IL1 = notes rev_conjI [intro] = conjI [THEN iffD1 [OF conj_commute]]

    lemma "[| P; Q |] ==> P & Q"
    proof -
      interpret my: IL1 .          txt {* No chained fact required. *}
      assume Q and P               txt {* order reversed *}
      then show "P & Q" ..         txt {* Applies @{thm my.rev_conjI}. *}
    qed

    locale IL11 = notes rev_conjI = conjI [THEN iffD1 [OF conj_commute]]

    lemma "[| P; Q |] ==> P & Q"
    proof -
      interpret [intro]: IL11 .     txt {* Attribute supplied at instantiation. *}
      assume Q and P
      then show "P & Q" ..
    qed

    subsection {* Simple locale with assumptions *}

    consts ibin :: "[i, i] => i" (infixl "#" 60)

    axioms i_assoc: "(x # y) # z = x # (y # z)"
      i_comm: "x # y = y # x"

    locale IL2 =
      fixes OP (infixl "+" 60)
      assumes assoc: "(x + y) + z = x + (y + z)"
        and comm: "x + y = y + x"

    lemma (in IL2) lcomm: "x + (y + z) = y + (x + z)"
    proof -
      have "x + (y + z) = (x + y) + z" by (simp add: assoc)
      also have "... = (y + x) + z" by (simp add: comm)
      also have "... = y + (x + z)" by (simp add: assoc)
      finally show ?thesis .
    qed

    lemmas (in IL2) AC = comm assoc lcomm

    lemma "(x::i) # y # z # w = y # x # w # z"
    proof -
      interpret my: IL2 ["op #"] by (rule IL2.intro [of "op #", OF i_assoc i_comm])
      show ?thesis by (simp only: my.OP.AC)  (* or my.AC *)
    qed

    subsection {* Nested locale with assumptions *}

    locale IL3 =
      fixes OP (infixl "+" 60)
      assumes assoc: "(x + y) + z = x + (y + z)"

    locale IL4 = IL3 +
      assumes comm: "x + y = y + x"

    lemma (in IL4) lcomm: "x + (y + z) = y + (x + z)"
    proof -
      have "x + (y + z) = (x + y) + z" by (simp add: assoc)
      also have "... = (y + x) + z" by (simp add: comm)
      also have "... = y + (x + z)" by (simp add: assoc)
      finally show ?thesis .
    qed

    lemmas (in IL4) AC = comm assoc lcomm

    lemma "(x::i) # y # z # w = y # x # w # z"
    proof -
      interpret my: IL4 ["op #"]
        by (auto intro: IL3.intro IL4_axioms.intro i_assoc i_comm)
      show ?thesis by (simp only: my.OP.AC)  (* or simply AC *)
    qed

    text {* Locale with definition *}

    text {* This example is admittedly not very creative :-) *}

    locale IL5 = IL4 + var A +
      defines A_def: "A == True"

    lemma (in IL5) lem: A
      by (unfold A_def) rule

    lemma "IL5(op #) ==> True"
    proof -
      assume "IL5(op #)"
      then interpret IL5 ["op #"] by (auto intro: IL5.axioms)
      show ?thesis by (rule lem)  (* lem instantiated to True *)
    qed

    text {* Interpretation in a context with target *}

    lemma (in IL4)
      fixes A (infixl "$" 60)
      assumes A: "IL4(A)"
      shows "(x::i) $ y $ z $ w = y $ x $ w $ z"
    proof -
      from A interpret A: IL4 ["A"] by (auto intro: IL4.axioms)
      show ?thesis by (simp only: A.OP.AC)
    qed

    section {* Interpretation in Locales *}

    text {* Naming convention for global objects: prefixes R and r *}

    locale (open) Rsemi = var prod (infixl "**" 65) +
      assumes assoc: "(x ** y) ** z = x ** (y ** z)"

    locale (open) Rlgrp = Rsemi + var one + var inv +
      assumes lone: "one ** x = x"
        and linv: "inv(x) ** x = one"

    lemma (in Rlgrp) lcancel:
      "x ** y = x ** z <-> y = z"
    proof
      assume "x ** y = x ** z"
      then have "inv(x) ** x ** y = inv(x) ** x ** z" by (simp add: assoc)
      then show "y = z" by (simp add: lone linv)
    qed simp

    locale (open) Rrgrp = Rsemi + var one + var inv +
      assumes rone: "x ** one = x"
        and rinv: "x ** inv(x) = one"

    lemma (in Rrgrp) rcancel:
      "y ** x = z ** x <-> y = z"
    proof
      assume "y ** x = z ** x"
      then have "y ** (x ** inv(x)) = z ** (x ** inv(x))"
        by (simp add: assoc [symmetric])
      then show "y = z" by (simp add: rone rinv)
    qed simp

    interpretation Rlgrp < Rrgrp
      proof -
        {
          fix x
          have "inv(x) ** x ** one = inv(x) ** x" by (simp add: linv lone)
          then show "x ** one = x" by (simp add: assoc lcancel)
        }
        note rone = this
        {
          fix x
          have "inv(x) ** x ** inv(x) = inv(x) ** one"
            by (simp add: linv lone rone)
          then show "x ** inv(x) = one" by (simp add: assoc lcancel)
        }
      qed

    (* effect on printed locale *)

    print_locale Rlgrp

    (* use of derived theorem *)

    lemma (in Rlgrp)
      "y ** x = z ** x <-> y = z"
      apply (rule rcancel)
      print_interps Rrgrp thm lcancel rcancel
      done

    (* circular interpretation *)

    interpretation Rrgrp < Rlgrp
      proof -
        {
          fix x
          have "one ** (x ** inv(x)) = x ** inv(x)" by (simp add: rinv rone)
          then show "one ** x = x" by (simp add: assoc [symmetric] rcancel)
        }
        note lone = this
        {
          fix x
          have "inv(x) ** (x ** inv(x)) = one ** inv(x)"
            by (simp add: rinv lone rone)
          then show "inv(x) ** x = one" by (simp add: assoc [symmetric] rcancel)
        }
      qed

    (* effect on printed locale *)

    print_locale! Rrgrp
    print_locale! Rlgrp

    (* locale with many parameters ---
       interpretations generate alternating group A5 *)

    locale RA5 = var A + var B + var C + var D + var E +
      assumes eq: "A <-> B <-> C <-> D <-> E"

    interpretation RA5 < RA5 _ _ D E C
    print_facts
    print_interps RA5
      using A_B_C_D_E.eq apply (blast intro: RA5.intro) done

    interpretation RA5 < RA5 C _ E _ A
    print_facts
    print_interps RA5
      using A_B_C_D_E.eq apply (blast intro: RA5.intro) done

    interpretation RA5 < RA5 B C A _ _
    print_facts
    print_interps RA5
      using A_B_C_D_E.eq apply (blast intro: RA5.intro) done

    lemma (in RA5) True
    print_facts
    print_interps RA5
      ..

    interpretation RA5 < RA5 _ C D B _ .
      (* Any even permutation of parameters is subsumed by the above. *)

    (* circle of three locales, forward direction *)

    locale (open) RA1 = var A + var B + assumes p: "A <-> B"
    locale (open) RA2 = var A + var B + assumes q: "A & B | ~ A & ~ B"
    locale (open) RA3 = var A + var B + assumes r: "(A --> B) & (B --> A)"

    interpretation RA1 < RA2
      print_facts
      using p apply fast done
    interpretation RA2 < RA3
      print_facts
      using q apply fast done
    interpretation RA3 < RA1
      print_facts
      using r apply fast done

    (* circle of three locales, backward direction *)

    locale (open) RB1 = var A + var B + assumes p: "A <-> B"
    locale (open) RB2 = var A + var B + assumes q: "A & B | ~ A & ~ B"
    locale (open) RB3 = var A + var B + assumes r: "(A --> B) & (B --> A)"

    interpretation RB1 < RB2
      print_facts
      using p apply fast done
    interpretation RB3 < RB1
      print_facts
      using r apply fast done
    interpretation RB2 < RB3
      print_facts
      using q apply fast done

    lemma (in RB1) True
      print_facts
      ..

    (* Group example revisited, with predicates *)

    locale Rpsemi = var prod (infixl "**" 65) +
      assumes assoc: "(x ** y) ** z = x ** (y ** z)"

    locale Rplgrp = Rpsemi + var one + var inv +
      assumes lone: "one ** x = x"
        and linv: "inv(x) ** x = one"

    lemma (in Rplgrp) lcancel:
      "x ** y = x ** z <-> y = z"
    proof
      assume "x ** y = x ** z"
      then have "inv(x) ** x ** y = inv(x) ** x ** z" by (simp add: assoc)
      then show "y = z" by (simp add: lone linv)
    qed simp

    locale Rprgrp = Rpsemi + var one + var inv +
      assumes rone: "x ** one = x"
        and rinv: "x ** inv(x) = one"

    lemma (in Rprgrp) rcancel:
      "y ** x = z ** x <-> y = z"
    proof
      assume "y ** x = z ** x"
      then have "y ** (x ** inv(x)) = z ** (x ** inv(x))"
        by (simp add: assoc [symmetric])
      then show "y = z" by (simp add: rone rinv)
    qed simp

    interpretation Rplgrp < Rprgrp
      proof (rule Rprgrp_axioms.intro)
        {
          fix x
          have "inv(x) ** x ** one = inv(x) ** x" by (simp add: linv lone)
          then show "x ** one = x" by (simp add: assoc lcancel)
        }
        note rone = this
        {
          fix x
          have "inv(x) ** x ** inv(x) = inv(x) ** one"
            by (simp add: linv lone rone)
          then show "x ** inv(x) = one" by (simp add: assoc lcancel)
        }
      qed

    (* effect on printed locale *)

    print_locale Rplgrp

    (* use of derived theorem *)

    lemma (in Rplgrp)
      "y ** x = z ** x <-> y = z"
      apply (rule rcancel)
      print_interps Rprgrp thm lcancel rcancel
      done

    (* circular interpretation *)

    interpretation Rprgrp < Rplgrp
      proof (rule Rplgrp_axioms.intro)
        {
          fix x
          have "one ** (x ** inv(x)) = x ** inv(x)" by (simp add: rinv rone)
          then show "one ** x = x" by (simp add: assoc [symmetric] rcancel)
        }
        note lone = this
        {
          fix x
          have "inv(x) ** (x ** inv(x)) = one ** inv(x)"
            by (simp add: rinv lone rone)
          then show "inv(x) ** x = one" by (simp add: assoc [symmetric] rcancel)
        }
      qed

    (* effect on printed locale *)

    print_locale Rprgrp
    print_locale Rplgrp

    subsection {* Interaction of Interpretation in Theories and Locales:
      in Locale, then in Theory *}

    consts
      rone :: i
      rinv :: "i => i"

    axioms
      r_one : "rone # x = x"
      r_inv : "rinv(x) # x = rone"

    interpretation Rbool: Rlgrp ["op #" "rone" "rinv"]
    proof -
      fix x y z
      {
        show "(x # y) # z = x # (y # z)" by (rule i_assoc)
      next
        show "rone # x = x" by (rule r_one)
      next
        show "rinv(x) # x = rone" by (rule r_inv)
      }
    qed

    (* derived elements *)

    print_interps Rrgrp
    print_interps Rlgrp

    lemma "y # x = z # x <-> y = z" by (rule Rbool.rcancel)

    (* adding lemma to derived element *)

    lemma (in Rrgrp) new_cancel:
      "b ** a = c ** a <-> b = c"
      by (rule rcancel)

    thm Rbool.new_cancel (* additional prems discharged!! *)

    ML {* check_thm "Rbool.new_cancel" *}

    lemma "b # a = c # a <-> b = c" by (rule Rbool.new_cancel)

    subsection {* Interaction of Interpretation in Theories and Locales:
      in Theory, then in Locale *}

    (* Another copy of the group example *)

    locale Rqsemi = var prod (infixl "**" 65) +
      assumes assoc: "(x ** y) ** z = x ** (y ** z)"

    locale Rqlgrp = Rqsemi + var one + var inv +
      assumes lone: "one ** x = x"
        and linv: "inv(x) ** x = one"

    lemma (in Rqlgrp) lcancel:
      "x ** y = x ** z <-> y = z"
    proof
      assume "x ** y = x ** z"
      then have "inv(x) ** x ** y = inv(x) ** x ** z" by (simp add: assoc)
      then show "y = z" by (simp add: lone linv)
    qed simp

    locale Rqrgrp = Rqsemi + var one + var inv +
      assumes rone: "x ** one = x"
        and rinv: "x ** inv(x) = one"

    lemma (in Rqrgrp) rcancel:
      "y ** x = z ** x <-> y = z"
    proof
      assume "y ** x = z ** x"
      then have "y ** (x ** inv(x)) = z ** (x ** inv(x))"
        by (simp add: assoc [symmetric])
      then show "y = z" by (simp add: rone rinv)
    qed simp

    interpretation Rqrgrp < Rprgrp
    proof -
      show "Rpsemi(op **)"
        apply (rule Rpsemi.intro) apply (rule assoc) done
    next
      show "Rprgrp_axioms(op **, one, inv)"
        apply (rule Rprgrp_axioms.intro) apply (rule rone) apply (rule rinv) done
    qed

    interpretation R2: Rqlgrp ["op #" "rone" "rinv"]
    proof -
      apply_end (rule Rqsemi.intro)
      fix x y z
      {
        show "(x # y) # z = x # (y # z)" by (rule i_assoc)
      next
      apply_end (rule Rqlgrp_axioms.intro)
        show "rone # x = x" by (rule r_one)
      next
        show "rinv(x) # x = rone" by (rule r_inv)
      }
    qed

    print_interps Rqsemi
    print_interps Rqlgrp
    print_interps Rplgrp  (* no interpretations yet *)

    interpretation Rqlgrp < Rqrgrp
      proof (rule Rqrgrp_axioms.intro)
        {
          fix x
          have "inv(x) ** x ** one = inv(x) ** x" by (simp add: linv lone)
          then show "x ** one = x" by (simp add: assoc lcancel)
        }
        note rone = this
        {
          fix x
          have "inv(x) ** x ** inv(x) = inv(x) ** one"
            by (simp add: linv lone rone)
          then show "x ** inv(x) = one" by (simp add: assoc lcancel)
        }
      qed

    print_interps! Rqrgrp
    print_interps! Rpsemi  (* witness must not have meta hyps *)
    print_interps! Rprgrp  (* witness must not have meta hyps *)
    print_interps! Rplgrp  (* witness must not have meta hyps *)
    thm R2.rcancel
    thm R2.lcancel

    ML {* check_thm "R2.rcancel"; check_thm "R2.lcancel" *}

    subsection {* Generation of Witness Theorems for Transitive Interpretations *}

    locale Rtriv = var x +
      assumes x: "x = x"

    locale Rtriv2 = var x + var y +
      assumes x: "x = x" and y: "y = y"

    interpretation Rtriv2 < Rtriv x
      apply (rule Rtriv.intro)
      apply (rule x)
      done

    interpretation Rtriv2 < Rtriv y
      apply (rule Rtriv.intro)
      apply (rule y)
      done

    print_locale Rtriv2

    locale Rtriv3 = var x + var y + var z +
      assumes x: "x = x" and y: "y = y" and z: "z = z"

    interpretation Rtriv3 < Rtriv2 x y
      apply (rule Rtriv2.intro)
      apply (rule x)
      apply (rule y)
      done

    print_locale Rtriv3

    interpretation Rtriv3 < Rtriv2 x z
      apply (rule Rtriv2.intro)
      apply (rule x_y_z.x)
      apply (rule z)
      done

    ML {* set show_types *}

    print_locale Rtriv3

    subsection {* Normalisation Replaces Assumed Element by Derived Element *}

    typedecl ('a, 'b) pair
    arities pair :: ("term", "term") "term"

    consts
      pair :: "['a, 'b] => ('a, 'b) pair"
      fst :: "('a, 'b) pair => 'a"
      snd :: "('a, 'b) pair => 'b"

    axioms
      fst [simp]: "fst(pair(x, y)) = x"
      snd [simp]: "snd(pair(x, y)) = y"

    locale Rpair = var prod (infixl "**" 65) + var prodP (infixl "***" 65) +
      defines P_def: "x *** y == pair(fst(x) ** fst(y), snd(x) ** snd(y))"

    locale Rpair_semi = Rpair + Rpsemi

    interpretation Rpair_semi < Rpsemi prodP (infixl "***" 65)
    proof (rule Rpsemi.intro)
      fix x y z
      show "(x *** y) *** z = x *** (y *** z)"
        by (unfold P_def) (simp add: assoc)
    qed

    locale Rsemi_rev = Rpsemi + var rprod (infixl "++" 65) +
      defines r_def: "x ++ y == y ** x"

    lemma (in Rsemi_rev) r_assoc:
      "(x ++ y) ++ z = x ++ (y ++ z)"
      by (simp add: r_def assoc)

    lemma (in Rpair_semi)
      includes Rsemi_rev prodP (infixl "***" 65) rprodP (infixl "+++" 65)
      constrains prod :: "['a, 'a] => 'a"
        and rprodP :: "[('a, 'a) pair, ('a, 'a) pair] => ('a, 'a) pair"
      shows "(x +++ y) +++ z = x +++ (y +++ z)"
      apply (rule r_assoc) done

    end

## Context Elements and Locale Expressions

### Renaming with Syntax

### Constrains

## Interpretation

theorem

      [| IA(a::'a::term); ID(a, b::'a::term) |] ==> True

theorem

      ID(a::'a::term, b::'a::term) ==> True

corollary th_x:

      ID(a::'a::term, b::'a::term) ==> True

lemma th_y:

      ID(a::'a::term, b::'a::term) ==> a = b == a = b

lemmas th_z:

      ID(a::'a::term, b::'a::term) ==> a = b == a = b

### Interpretation in Proof Contexts

theorem

      True

theorem

      IA(a::'a::term) ==> True

lemma

      True

lemma

      [| P; Q |] ==> P ∧ Q

lemma

      [| P; Q |] ==> P ∧ Q

### Simple locale with assumptions

lemma lcomm:

      IL2(OP) ==> OP(x, OP(y, z)) = OP(y, OP(x, z))

lemmas AC:

      IL2(OP) ==> OP(x, y) = OP(y, x)

      IL2(OP) ==> OP(OP(x, y), z) = OP(x, OP(y, z))

      IL2(OP) ==> OP(x, OP(y, z)) = OP(y, OP(x, z))

lemma

      x # y # z # w = y # x # w # z

### Nested locale with assumptions

lemma lcomm:

      IL4(OP) ==> OP(x, OP(y, z)) = OP(y, OP(x, z))

lemmas AC:

      IL4(OP) ==> OP(x, y) = OP(y, x)

      IL4(OP) ==> OP(OP(x, y), z) = OP(x, OP(y, z))

      IL4(OP) ==> OP(x, OP(y, z)) = OP(y, OP(x, z))

lemma

      x # y # z # w = y # x # w # z

lemma lem:

      IL5(OP) ==> True

lemma

      IL5(op #) ==> True

lemma

      [| IL4(OP); IL4(A) |] ==> A(A(A(x, y), z), w) = A(A(A(y, x), w), z)

## Interpretation in Locales

lemma lcancel:

      [| !!x y z. prod(prod(x, y), z) = prod(x, prod(y, z)); !!x. prod(one, x) = x;
         !!x. prod(inv(x), x) = one |]
      ==> prod(x, y) = prod(x, z) <-> y = z

lemma rcancel:

      [| !!x y z. prod(prod(x, y), z) = prod(x, prod(y, z)); !!x. prod(x, one) = x;
         !!x. prod(x, inv(x)) = one |]
      ==> prod(y, x) = prod(z, x) <-> y = z

lemma

      [| !!x y z. prod(prod(x, y), z) = prod(x, prod(y, z)); !!x. prod(one, x) = x;
         !!x. prod(inv(x), x) = one |]
      ==> prod(y, x) = prod(z, x) <-> y = z

lemma

      RA5(A, B, C, D, E) ==> True

lemma

      A <-> B ==> True

lemma lcancel:

      Rplgrp(prod, one, inv) ==> prod(x, y) = prod(x, z) <-> y = z

lemma rcancel:

      Rprgrp(prod, one, inv) ==> prod(y, x) = prod(z, x) <-> y = z

lemma

      Rplgrp(prod, one, inv) ==> prod(y, x) = prod(z, x) <-> y = z

### Interaction of Interpretation in Theories and Locales: in Locale, then in Theory

lemma

      y # x = z # x <-> y = z

lemma new_cancel:

      [| !!x y z. prod(prod(x, y), z) = prod(x, prod(y, z)); !!x. prod(x, one) = x;
         !!x. prod(x, inv(x)) = one |]
      ==> prod(b, a) = prod(c, a) <-> b = c

lemma

      b # a = c # a <-> b = c

### Interaction of Interpretation in Theories and Locales: in Theory, then in Locale

lemma lcancel:

      Rqlgrp(prod, one, inv) ==> prod(x, y) = prod(x, z) <-> y = z

lemma rcancel:

      Rqrgrp(prod, one, inv) ==> prod(y, x) = prod(z, x) <-> y = z

### Generation of Witness Theorems for Transitive Interpretations

### Normalisation Replaces Assumed Element by Derived Element

lemma r_assoc:

      Rsemi_rev(prod::'a => 'a => 'a)
      ==> prod(z::'a, prod(y::'a, x::'a)) = prod(prod(z, y), x)

lemma

      Rpair_semi(prod::'a => 'a => 'a)
      ==> pair(prod(fst(z::('a, 'a) pair),
                    fst(pair(prod(fst(y::('a, 'a) pair), fst(x::('a, 'a) pair)),
                             prod(snd(y), snd(x))))),
               prod(snd(z), snd(pair(prod(fst(y), fst(x)), prod(snd(y), snd(x)))))) =
          pair(prod(fst(pair(prod(fst(z), fst(y)), prod(snd(z), snd(y)))), fst(x)),
               prod(snd(pair(prod(fst(z), fst(y)), prod(snd(z), snd(y)))), snd(x)))