diff --git a/utp_des_core.thy b/utp_des_core.thy index c9b81e7..d6ca915 100644 --- a/utp_des_core.thy +++ b/utp_des_core.thy @@ -37,7 +37,7 @@ abbreviation drop_desr ("\_\\<^sub>D") where "\P\\<^sub>D \ P \ (\<^bold>v\<^sub>D \ \<^bold>v\<^sub>D)" abbreviation dcond :: "('\, '\) des_rel \ '\ pred \ ('\, '\) des_rel \ ('\, '\) des_rel" -where "dcond P b Q \ P \ \b\\<^sub>D\<^sub>< \ Q" +where "dcond P b Q \ P \ (b \ \<^bold>v\<^sub>D) \ Q" syntax "_dcond" :: "logic \ logic \ logic \ logic" ("(3_ \ _ \\<^sub>D/ _)" [52,0,53] 52) translations "_dcond P b Q" == "CONST dcond P (b)\<^sub>e Q" diff --git a/utp_des_laws.thy b/utp_des_laws.thy index e2e8cc4..a5788d8 100644 --- a/utp_des_laws.thy +++ b/utp_des_laws.thy @@ -302,7 +302,7 @@ theorem design_condr: by (pred_auto) theorem ndesign_dcond [ndes_simp]: - shows "((p\<^sub>1 \\<^sub>n P\<^sub>2) \ b\<^sup>< \ more\<^sub>L\<^sup>2 \ (q\<^sub>1 \\<^sub>n Q\<^sub>2)) = ((p\<^sub>1 \ b \ q\<^sub>1) \\<^sub>n (P\<^sub>2 \ b\<^sup>< \ Q\<^sub>2))" + shows "(dcond (p\<^sub>1 \\<^sub>n P\<^sub>2) b (q\<^sub>1 \\<^sub>n Q\<^sub>2)) = ((p\<^sub>1 \ b \ q\<^sub>1) \\<^sub>n (P\<^sub>2 \ b\<^sup>< \ Q\<^sub>2))" by (pred_auto) lemma design_UINF_mem: