src/FOL/ex/Propositional_Int.thy
changeset 51798 ad3a241def73
parent 31974 e81979a703a4
child 58889 5b7a9633cfa8
--- a/src/FOL/ex/Propositional_Int.thy	Sat Apr 27 11:37:50 2013 +0200
+++ b/src/FOL/ex/Propositional_Int.thy	Sat Apr 27 20:50:20 2013 +0200
@@ -12,106 +12,106 @@
 text {* commutative laws of @{text "&"} and @{text "|"} *}
 
 lemma "P & Q  -->  Q & P"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "P | Q  -->  Q | P"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 
 text {* associative laws of @{text "&"} and @{text "|"} *}
 lemma "(P & Q) & R  -->  P & (Q & R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P | Q) | R  -->  P | (Q | R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 
 text {* distributive laws of @{text "&"} and @{text "|"} *}
 lemma "(P & Q) | R  --> (P | R) & (Q | R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P | R) & (Q | R)  --> (P & Q) | R"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P | Q) & R  --> (P & R) | (Q & R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P & R) | (Q & R)  --> (P | Q) & R"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 
 text {* Laws involving implication *}
 
 lemma "(P-->R) & (Q-->R) <-> (P|Q --> R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P & Q --> R) <-> (P--> (Q-->R))"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "((P-->R)-->R) --> ((Q-->R)-->R) --> (P&Q-->R) --> R"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "~(P-->R) --> ~(Q-->R) --> ~(P&Q-->R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P --> Q & R) <-> (P-->Q)  &  (P-->R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 
 text {* Propositions-as-types *}
 
 -- {* The combinator K *}
 lemma "P --> (Q --> P)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 -- {* The combinator S *}
 lemma "(P-->Q-->R)  --> (P-->Q) --> (P-->R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 
 -- {* Converse is classical *}
 lemma "(P-->Q) | (P-->R)  -->  (P --> Q | R)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma "(P-->Q)  -->  (~Q --> ~P)"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 
 text {* Schwichtenberg's examples (via T. Nipkow) *}
 
 lemma stab_imp: "(((Q-->R)-->R)-->Q) --> (((P-->Q)-->R)-->R)-->P-->Q"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma stab_to_peirce:
   "(((P --> R) --> R) --> P) --> (((Q --> R) --> R) --> Q)  
                               --> ((P --> Q) --> P) --> P"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma peirce_imp1: "(((Q --> R) --> Q) --> Q)  
                 --> (((P --> Q) --> R) --> P --> Q) --> P --> Q"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
   
 lemma peirce_imp2: "(((P --> R) --> P) --> P) --> ((P --> Q --> R) --> P) --> P"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma mints: "((((P --> Q) --> P) --> P) --> Q) --> Q"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma mints_solovev: "(P --> (Q --> R) --> Q) --> ((P --> Q) --> R) --> R"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma tatsuta: "(((P7 --> P1) --> P10) --> P4 --> P5)  
   --> (((P8 --> P2) --> P9) --> P3 --> P10)  
   --> (P1 --> P8) --> P6 --> P7  
   --> (((P3 --> P2) --> P9) --> P4)  
   --> (P1 --> P3) --> (((P6 --> P1) --> P2) --> P9) --> P5"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 lemma tatsuta1: "(((P8 --> P2) --> P9) --> P3 --> P10)  
   --> (((P3 --> P2) --> P9) --> P4)  
   --> (((P6 --> P1) --> P2) --> P9)  
   --> (((P7 --> P1) --> P10) --> P4 --> P5)  
   --> (P1 --> P3) --> (P1 --> P8) --> P6 --> P7 --> P5"
-  by (tactic "IntPr.fast_tac 1")
+  by (tactic "IntPr.fast_tac @{context} 1")
 
 end