# HG changeset patch # User wenzelm # Date 1727858144 -7200 # Node ID 6c81cdca5b82585acebafea3dca531342e196c8b # Parent e957b2dd8983defdb58b6ed6d10127a79fb61194 more inner syntax markup: HOL-Analysis; diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Bochner_Integration.thy --- a/src/HOL/Analysis/Bochner_Integration.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Bochner_Integration.thy Wed Oct 02 10:35:44 2024 +0200 @@ -890,7 +890,8 @@ "integral\<^sup>L M f = (if \x. has_bochner_integral M f x then THE x. has_bochner_integral M f x else 0)" syntax - "_lebesgue_integral" :: "pttrn \ real \ 'a measure \ real" (\\((2 _./ _)/ \_)\ [60,61] 110) + "_lebesgue_integral" :: "pttrn \ real \ 'a measure \ real" + (\(\indent=1 notation=\binder integral\\\(2 _./ _)/ \_)\ [60,61] 110) syntax_consts "_lebesgue_integral" == lebesgue_integral @@ -899,7 +900,8 @@ "\ x. f \M" == "CONST lebesgue_integral M (\x. f)" syntax - "_ascii_lebesgue_integral" :: "pttrn \ 'a measure \ real \ real" (\(3LINT (1_)/|(_)./ _)\ [0,110,60] 60) + "_ascii_lebesgue_integral" :: "pttrn \ 'a measure \ real \ real" + (\(\indent=3 notation=\mixfix LINT\\LINT (1_)/|(_)./ _)\ [0,110,60] 60) syntax_consts "_ascii_lebesgue_integral" == lebesgue_integral diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Bounded_Continuous_Function.thy --- a/src/HOL/Analysis/Bounded_Continuous_Function.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Bounded_Continuous_Function.thy Wed Oct 02 10:35:44 2024 +0200 @@ -10,7 +10,7 @@ definition\<^marker>\tag important\ "bcontfun = {f. continuous_on UNIV f \ bounded (range f)}" -typedef (overloaded) ('a, 'b) bcontfun (\(_ \\<^sub>C /_)\ [22, 21] 21) = +typedef (overloaded) ('a, 'b) bcontfun (\(\notation=\infix \\<^sub>C\\_ \\<^sub>C /_)\ [22, 21] 21) = "bcontfun::('a::topological_space \ 'b::metric_space) set" morphisms apply_bcontfun Bcontfun by (auto intro: continuous_intros simp: bounded_def bcontfun_def) diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Bounded_Linear_Function.thy --- a/src/HOL/Analysis/Bounded_Linear_Function.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Bounded_Linear_Function.thy Wed Oct 02 10:35:44 2024 +0200 @@ -116,7 +116,7 @@ subsection \Type of bounded linear functions\ -typedef\<^marker>\tag important\ (overloaded) ('a, 'b) blinfun (\(_ \\<^sub>L /_)\ [22, 21] 21) = +typedef\<^marker>\tag important\ (overloaded) ('a, 'b) blinfun (\(\notation=\infix \\<^sub>L\\_ \\<^sub>L /_)\ [22, 21] 21) = "{f::'a::real_normed_vector\'b::real_normed_vector. bounded_linear f}" morphisms blinfun_apply Blinfun by (blast intro: bounded_linear_intros) diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Finite_Product_Measure.thy --- a/src/HOL/Analysis/Finite_Product_Measure.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Finite_Product_Measure.thy Wed Oct 02 10:35:44 2024 +0200 @@ -169,7 +169,8 @@ "Pi\<^sub>M I M \ PiM I M" syntax - "_PiM" :: "pttrn \ 'i set \ 'a measure \ ('i => 'a) measure" (\(3\\<^sub>M _\_./ _)\ 10) + "_PiM" :: "pttrn \ 'i set \ 'a measure \ ('i => 'a) measure" + (\(\indent=3 notation=\binder \\<^sub>M\\\\<^sub>M _\_./ _)\ 10) syntax_consts "_PiM" == PiM translations diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Infinite_Set_Sum.thy --- a/src/HOL/Analysis/Infinite_Set_Sum.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Infinite_Set_Sum.thy Wed Oct 02 10:35:44 2024 +0200 @@ -96,10 +96,10 @@ syntax (ASCII) "_infsetsum" :: "pttrn \ 'a set \ 'b \ 'b::{banach, second_countable_topology}" - (\(3INFSETSUM _:_./ _)\ [0, 51, 10] 10) + (\(\indent=3 notation=\binder INFSETSUM\\INFSETSUM _:_./ _)\ [0, 51, 10] 10) syntax "_infsetsum" :: "pttrn \ 'a set \ 'b \ 'b::{banach, second_countable_topology}" - (\(2\\<^sub>a_\_./ _)\ [0, 51, 10] 10) + (\(\indent=2 notation=\binder \\<^sub>a\\\\<^sub>a_\_./ _)\ [0, 51, 10] 10) syntax_consts "_infsetsum" \ infsetsum translations \ \Beware of argument permutation!\ @@ -107,10 +107,10 @@ syntax (ASCII) "_uinfsetsum" :: "pttrn \ 'a set \ 'b \ 'b::{banach, second_countable_topology}" - (\(3INFSETSUM _:_./ _)\ [0, 51, 10] 10) + (\(\indent=3 notation=\binder INFSETSUM\\INFSETSUM _:_./ _)\ [0, 51, 10] 10) syntax "_uinfsetsum" :: "pttrn \ 'b \ 'b::{banach, second_countable_topology}" - (\(2\\<^sub>a_./ _)\ [0, 10] 10) + (\(\indent=2 notation=\binder \\<^sub>a\\\\<^sub>a_./ _)\ [0, 10] 10) syntax_consts "_uinfsetsum" \ infsetsum translations \ \Beware of argument permutation!\ @@ -118,10 +118,10 @@ syntax (ASCII) "_qinfsetsum" :: "pttrn \ bool \ 'a \ 'a::{banach, second_countable_topology}" - (\(3INFSETSUM _ |/ _./ _)\ [0, 0, 10] 10) + (\(\indent=3 notation=\binder INFSETSUM\\INFSETSUM _ |/ _./ _)\ [0, 0, 10] 10) syntax "_qinfsetsum" :: "pttrn \ bool \ 'a \ 'a::{banach, second_countable_topology}" - (\(2\\<^sub>a_ | (_)./ _)\ [0, 0, 10] 10) + (\(\indent=2 notation=\binder \\<^sub>a\\\\<^sub>a_ | (_)./ _)\ [0, 0, 10] 10) syntax_consts "_qinfsetsum" \ infsetsum translations diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Infinite_Sum.thy --- a/src/HOL/Analysis/Infinite_Sum.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Infinite_Sum.thy Wed Oct 02 10:35:44 2024 +0200 @@ -47,27 +47,29 @@ "f abs_summable_on A \ (\x. norm (f x)) summable_on A" syntax (ASCII) - "_infsum" :: "pttrn \ 'a set \ 'b \ 'b::topological_comm_monoid_add" (\(3INFSUM (_/:_)./ _)\ [0, 51, 10] 10) + "_infsum" :: "pttrn \ 'a set \ 'b \ 'b::topological_comm_monoid_add" + (\(\indent=3 notation=\binder INFSUM\\INFSUM (_/:_)./ _)\ [0, 51, 10] 10) syntax - "_infsum" :: "pttrn \ 'a set \ 'b \ 'b::topological_comm_monoid_add" (\(2\\<^sub>\(_/\_)./ _)\ [0, 51, 10] 10) + "_infsum" :: "pttrn \ 'a set \ 'b \ 'b::topological_comm_monoid_add" + (\(\indent=2 notation=\binder \\<^sub>\\\\\<^sub>\(_/\_)./ _)\ [0, 51, 10] 10) syntax_consts "_infsum" \ infsum translations \ \Beware of argument permutation!\ "\\<^sub>\i\A. b" \ "CONST infsum (\i. b) A" syntax (ASCII) - "_univinfsum" :: "pttrn \ 'a \ 'a" (\(3INFSUM _./ _)\ [0, 10] 10) + "_univinfsum" :: "pttrn \ 'a \ 'a" (\(\indent=3 notation=\binder INFSUM\\INFSUM _./ _)\ [0, 10] 10) syntax - "_univinfsum" :: "pttrn \ 'a \ 'a" (\(2\\<^sub>\_./ _)\ [0, 10] 10) + "_univinfsum" :: "pttrn \ 'a \ 'a" (\(\indent=2 notation=\binder \\<^sub>\\\\\<^sub>\_./ _)\ [0, 10] 10) syntax_consts "_univinfsum" \ infsum translations "\\<^sub>\x. t" \ "CONST infsum (\x. t) (CONST UNIV)" syntax (ASCII) - "_qinfsum" :: "pttrn \ bool \ 'a \ 'a" (\(3INFSUM _ |/ _./ _)\ [0, 0, 10] 10) + "_qinfsum" :: "pttrn \ bool \ 'a \ 'a" (\(\indent=3 notation=\binder INFSUM\\INFSUM _ |/ _./ _)\ [0, 0, 10] 10) syntax - "_qinfsum" :: "pttrn \ bool \ 'a \ 'a" (\(2\\<^sub>\_ | (_)./ _)\ [0, 0, 10] 10) + "_qinfsum" :: "pttrn \ bool \ 'a \ 'a" (\(\indent=2 notation=\binder \\<^sub>\\\\\<^sub>\_ | (_)./ _)\ [0, 0, 10] 10) syntax_consts "_qinfsum" \ infsum translations diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Inner_Product.thy --- a/src/HOL/Analysis/Inner_Product.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Inner_Product.thy Wed Oct 02 10:35:44 2024 +0200 @@ -391,9 +391,8 @@ subsection \Gradient derivative\ definition\<^marker>\tag important\ - gderiv :: - "['a::real_inner \ real, 'a, 'a] \ bool" - (\(GDERIV (_)/ (_)/ :> (_))\ [1000, 1000, 60] 60) + gderiv :: "['a::real_inner \ real, 'a, 'a] \ bool" + (\(\notation=\mixfix GDERIV\\GDERIV (_)/ (_)/ :> (_))\ [1000, 1000, 60] 60) where "GDERIV f x :> D \ FDERIV f x :> (\h. inner h D)" diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Interval_Integral.thy --- a/src/HOL/Analysis/Interval_Integral.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Interval_Integral.thy Wed Oct 02 10:35:44 2024 +0200 @@ -146,7 +146,7 @@ syntax "_ascii_interval_lebesgue_integral" :: "pttrn \ real \ real \ real measure \ real \ real" - (\(5LINT _=_.._|_. _)\ [0,60,60,61,100] 60) + (\(\indent=5 notation=\binder LINT\\LINT _=_.._|_. _)\ [0,60,60,61,100] 60) syntax_consts "_ascii_interval_lebesgue_integral" == interval_lebesgue_integral @@ -160,7 +160,7 @@ syntax "_ascii_interval_lebesgue_borel_integral" :: "pttrn \ real \ real \ real \ real" - (\(4LBINT _=_.._. _)\ [0,60,60,61] 60) + (\(\indent=4 notation=\binder LBINT\\LBINT _=_.._. _)\ [0,60,60,61] 60) syntax_consts "_ascii_interval_lebesgue_borel_integral" == interval_lebesgue_integral @@ -1049,7 +1049,7 @@ syntax "_complex_lebesgue_borel_integral" :: "pttrn \ real \ complex" - (\(2CLBINT _. _)\ [0,60] 60) + (\(\indent=2 notation=\binder CLBINT\\CLBINT _. _)\ [0,60] 60) syntax_consts "_complex_lebesgue_borel_integral" == complex_lebesgue_integral @@ -1057,7 +1057,7 @@ translations "CLBINT x. f" == "CONST complex_lebesgue_integral CONST lborel (\x. f)" syntax "_complex_set_lebesgue_borel_integral" :: "pttrn \ real set \ real \ complex" - (\(3CLBINT _:_. _)\ [0,60,61] 60) + (\(\indent=3 notation=\binder CLBINT\\CLBINT _:_. _)\ [0,60,61] 60) syntax_consts "_complex_set_lebesgue_borel_integral" == complex_set_lebesgue_integral @@ -1075,7 +1075,7 @@ syntax "_ascii_complex_interval_lebesgue_borel_integral" :: "pttrn \ ereal \ ereal \ real \ complex" - (\(4CLBINT _=_.._. _)\ [0,60,60,61] 60) + (\(\indent=4 notation=\binder CLBINT\\CLBINT _=_.._. _)\ [0,60,60,61] 60) syntax_consts "_ascii_complex_interval_lebesgue_borel_integral" == complex_interval_lebesgue_integral diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Nonnegative_Lebesgue_Integration.thy --- a/src/HOL/Analysis/Nonnegative_Lebesgue_Integration.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Nonnegative_Lebesgue_Integration.thy Wed Oct 02 10:35:44 2024 +0200 @@ -820,7 +820,7 @@ "integral\<^sup>N M f = (SUP g \ {g. simple_function M g \ g \ f}. integral\<^sup>S M g)" syntax - "_nn_integral" :: "pttrn \ ennreal \ 'a measure \ ennreal" (\\\<^sup>+((2 _./ _)/ \_)\ [60,61] 110) + "_nn_integral" :: "pttrn \ ennreal \ 'a measure \ ennreal" (\(\indent=2 notation=\binder integral\\\\<^sup>+(2 _./ _)/ \_)\ [60,61] 110) syntax_consts "_nn_integral" == nn_integral diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Set_Integral.thy --- a/src/HOL/Analysis/Set_Integral.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Set_Integral.thy Wed Oct 02 10:35:44 2024 +0200 @@ -24,7 +24,7 @@ syntax "_ascii_set_lebesgue_integral" :: "pttrn \ 'a set \ 'a measure \ real \ real" - (\(4LINT (_):(_)/|(_)./ _)\ [0,0,0,10] 10) + (\(\indent=4 notation=\binder LINT\\LINT (_):(_)/|(_)./ _)\ [0,0,0,10] 10) syntax_consts "_ascii_set_lebesgue_integral" == set_lebesgue_integral @@ -43,11 +43,11 @@ syntax "_lebesgue_borel_integral" :: "pttrn \ real \ real" - (\(2LBINT _./ _)\ [0,10] 10) + (\(\indent=2 notation=\binder LBINT\\LBINT _./ _)\ [0,10] 10) syntax "_set_lebesgue_borel_integral" :: "pttrn \ real set \ real \ real" - (\(3LBINT _:_./ _)\ [0,0,10] 10) + (\(\indent=3 notation=\binder LBINT\\LBINT _:_./ _)\ [0,0,10] 10) section \Basic properties\ @@ -587,7 +587,7 @@ syntax "_ascii_complex_lebesgue_integral" :: "pttrn \ 'a measure \ real \ real" - (\(3CLINT _|_. _)\ [0,0,10] 10) + (\(\indent=3 notation=\binder CLINT\\CLINT _|_. _)\ [0,0,10] 10) syntax_consts "_ascii_complex_lebesgue_integral" == complex_lebesgue_integral @@ -624,7 +624,7 @@ syntax "_ascii_complex_set_lebesgue_integral" :: "pttrn \ 'a set \ 'a measure \ real \ real" - (\(4CLINT _:_|_. _)\ [0,0,0,10] 10) + (\(\indent=4 notation=\binder CLINT\\CLINT _:_|_. _)\ [0,0,0,10] 10) syntax_consts "_ascii_complex_set_lebesgue_integral" == complex_set_lebesgue_integral @@ -647,10 +647,10 @@ syntax "_set_nn_integral" :: "pttrn => 'a set => 'a measure => ereal => ereal" -(\(\\<^sup>+((_)\(_)./ _)/\_)\ [0,0,0,110] 10) +(\(\notation=\binder integral\\\\<^sup>+((_)\(_)./ _)/\_)\ [0,0,0,110] 10) "_set_lebesgue_integral" :: "pttrn => 'a set => 'a measure => ereal => ereal" -(\(\((_)\(_)./ _)/\_)\ [0,0,0,110] 10) +(\(\notation=\binder integral\\\((_)\(_)./ _)/\_)\ [0,0,0,110] 10) syntax_consts "_set_nn_integral" == set_nn_integral and diff -r e957b2dd8983 -r 6c81cdca5b82 src/HOL/Analysis/Sparse_In.thy --- a/src/HOL/Analysis/Sparse_In.thy Wed Oct 02 10:34:41 2024 +0200 +++ b/src/HOL/Analysis/Sparse_In.thy Wed Oct 02 10:35:44 2024 +0200 @@ -165,14 +165,14 @@ "cosparse A = Abs_filter (\P. {x. \P x} sparse_in A)" syntax - "_eventually_cosparse" :: "pttrn => 'a set => bool => bool" (\(3\\<^sub>\_\_./ _)\ [0, 0, 10] 10) + "_eventually_cosparse" :: "pttrn => 'a set => bool => bool" (\(\indent=3 notation=\binder \\\\\\<^sub>\_\_./ _)\ [0, 0, 10] 10) syntax_consts "_eventually_cosparse" == eventually translations "\\<^sub>\x\A. P" == "CONST eventually (\x. P) (CONST cosparse A)" syntax - "_qeventually_cosparse" :: "pttrn \ bool \ 'a \ 'a" (\(3\\<^sub>\_ | (_)./ _)\ [0, 0, 10] 10) + "_qeventually_cosparse" :: "pttrn \ bool \ 'a \ 'a" (\(\indent=3 notation=\binder \\\\\\<^sub>\_ | (_)./ _)\ [0, 0, 10] 10) syntax_consts "_qeventually_cosparse" == eventually translations