Search

23 May 2024: next assume "euclidean_size bshow "bproof (assume "bwith mod_size_less have "euclidean_size (b mod b)b". ... b dvd f a}› with ‹finite A› have ‹finite B› and ‹a B b dvd f a› for a by simp_all then have ‹(aB.

23 May 2024: simp]: "⟦b; b⟧ b m b n n m" using power_strict_decreasing [of m n b] by (auto intro:lemma power_strict_decreasing_iff [simp]: "⟦b; b⟧ b m < b ... le) qed lemma power_increasing_iff [simp]: "b b x b y x y" by (blast intro:less_imp_le) lemma

23 May 2024: fixes f::"_ _ :: {assumes [M f" "AM" "BM" and null: "(A - B) (B - A)M" shows "(x A. ... a (A - B) (B - A)" usingby blast then show "AE x in M.

23 May 2024: x A" and "Ashows "x A) = x F A" proof - from ‹A› obtain b where "b A" by blast then obtain B where : "Ab B" "b B" by (blast dest: ... a set 'b 'b" ("(3MAX __./ _)" [0, 0, 10] 10) translations "MIN x y.

23 May 2024: b' B (b, b') r" proof fix b' show "b' B (b, b') r" proof assume As: "b' B" hence : "br b'r" usingby auto fromhave "b' = b (b',b) r" ... by auto moreover have "b' = b (b, b') r" usingby (auto simp add: refl_on_def) moreover have "b' b (b',b) r (b,b') r"

23 May 2024: Pz = x) (Pz = y))" definition Let :: "'a ('a 'b) 'b" where "Let s f f s" translations "_Let (_binds b bs) e" "_Let b (_Let bs e)" "let x = a in ... lemma not_sym: "t s s t" by (erule contrapos_nn) (erule sym) lemma eq_neq_eq_imp_neq: "⟦x = a; a b; b =

23 May 2024: A = B; B = C⟧ A = C" and trans_elem: "a b c A. ... A type; b : B⟧ inr(b) : AB" and PlusI_inrL: "b d A B.

23 May 2024: session key and various verifiers) | SR7: "⟦ evs7 sr; Nonce Nbevs7;B); BKNb,pairK(A,B)); Key Kevs7; Inputs B (Card B) ⦃Agent A, Nonce Na⦄evs7⟧B) B ⦃Nonce Nb, Key ... lemma Confidentiality_B: "⟦B) B ⦃Nonce Nb, Key K, Certificate,A,B)) (Nonce

23 May 2024: thesis by (simp add:qed theorem n_subsets: assumes "finite A" shows "card {B. ... g? B? B'" apply (where f' = "λl. (ll"]) using assms by (auto simp: 2 simp flip: length_0_conv intro!: 3) have fin: "finite {xs.

23 May 2024: bvusing ‹T› by auto have [simp]: " T {v. bvusing ‹norm b› ‹b T› by auto define f where "f λx. ... R. ba} (- U)for a::'a and b::'b by force have : "r.

23 May 2024: B; u A; v B⟧ A B" by (lemma insert_lepoll_cong: assumes "A B" "b B" shows "insert a Ab B" proof - obtain f where f: "inj_on f A" ... where "inj_on f A" "f A B" using assms by (then obtain b where b: "b B" "b f A" by auto show?

23 May 2024: apply (fast intro!: FiniteFun.intros) done lemma FiniteFun_subset: "⟦c<=b; b A-||>B⟧ c A-||>B" by (blast intro: FiniteFun_subset_lemma) ( Some further results by Sidi O. ... f A->B f A-||>B" apply (erule Fin.induct) apply (simp add:apply (case_tac "a

23 May 2024: case by (auto intro!: exI[of _ "min a b"]) next case UN then show? ... Q b b < a" and P: "eventually P at_top" shows "filterlim fa)" proof - from P obtain x where x: "y.

30 Apr 2024: Alternatively, you can book a hotel or B&B room via the Visit Cambridge website or visit the Cambridge Rooms site that includes accommodation at other Colleges.

23 May 2024: a = x) = a" by blast subsection‹Conditional Terms: ‹if-then-else›› lemma if_true [simp]: "(a else b) = a" by (unfoldlemma if_false [simp]: "(a else b) = b" by (unfoldNever use ... lemma misc_simps [simp]: "A = A" "AA" "AAAAA" "b,A)) = bA)" "({b})

23 May 2024: thesis. qed lemma sigma_sets_UNION: "countable B (b. b B bX A) BX A" using from_nat_into [of B] range_from_nat_into [of B] sigma_sets.Union [of ... a A aM B" assumes B: "b. b B bM A" shows "sigma_sets M AM B" proof (introfix a assume "aM A" fromshow "aM B

23 May 2024: lemma SigmaD1: "(a, b)A B a A" by blast lemma SigmaD2: "(a, b)A B b B a" by blast lemma SigmaE2: "(a, b)A B (a A b B ... j). (j, i)) (A B) = B A" by (auto simp add: set_eq_iff) lemma image_split_eq_Sigma: "(λx.

23 May 2024: b T j (i b) = b" "b. b T i b S" assumes eq: "a. ... b T - T' j (i b) = b" "b. b T - T' i b S - S'" assumes nn: "a.

23 May 2024: a = "aλb. (a b / (b b)). R. ... a b / (b b)). R.

23 May 2024: finally have "b<": "b r (a f b) f c". fromhave "c<": "c r (a f b) f c". ... also fromhave "… r a f …". finally have "b<": "b r a f (b f c)".

23 May 2024: Q(x))› apply (eruleTHEN mp] | assumption | ruleerule (1)done subsection ‹Equality rules› lemma sym: ‹a = b b = a› apply (erule subst) apply (rule refl) done lemma trans: ‹⟦a = b; b = c⟧ ... for the equality predicate!› lemma eq_cong:

23 May 2024: bB r a b" "a1 a2 b. ⟦ a1 A; a2 A; b B; r a1 b; r a2 b ⟧ a1 = a2" shows "card AB" proof - let? ... P = "λa b. b B r a b" let? f = "λa.

23 May 2024: combine_options (f x) (m1 x) (m2 x))" unfolding combine_options_def by transfer_prover lemma combine_parametric: "((B ===> B ===> B) ===> (AB) ===> (AB) ===> (AB)) (λf m1 m2 x. ... lift_definition combine :: "('b 'b 'b) ('a,'b) mapping ('a,'b) mapping

23 May 2024: thesis using rel_interior_sing by auto next case False obtain B where B: "independent B B S SBBS" using basis_exists[of S] by metis then have "Busing‹S› ... empty by auto have "BB" using subspace_span[of B] subspace_0[of "span B"] span_superset by

23 May 2024: BA. f B B})" proof (rule order.antisym) show "A)f A |f. ... B A f B B" "B A" for f B using that by (auto intro: SUP_upper2 INF_lower2) then show "(x?F.

23 May 2024: thesis by auto next case False from ‹a dvd b› obtain c where b: "b = a c". ... b b" by simp then have "normalize aa div b b)" by simp then show?

23 May 2024: card the session key and various verifiers) | SR_U7: "⟦ evs7 srb; Nonce Nbevs7;B); BKNb,pairK(A,B)); Key Kevs7; Inputs B (Card B) ⦃Agent A, Nonce Na⦄evs7⟧B) B ... sesK_authentic) done lemma Confidentiality_B: "⟦B) B ⦃Nonce Nb, Agent A, Key K,

23 May 2024: ng ((n2)) sums x" using sums_if'[OF ‹g sums x›]. have if_eq: "B T E. ... xa <.< b} ya <.< bf x n - f y nL nx - y" shows "DERIV (λ x.

23 May 2024: definition length :: "'awhere "length dxsdxs)" qualified definition fold :: "('a 'b 'b) 'a dlist 'b 'b" where "fold f dxsf (list_of_dlist dxs)" qualified definition foldr :: "('a 'b 'b) 'a dlist ... b 'b" where "foldr f dxsf (list_of_dlist dxs)" end

23 May 2024: by (simp add:next show "a a" for a by (simp add: order_iff) next fix a b assume "a b" "b a" then have "a = a b" "a b = b" ... by (simp_all add: order_iff commute) then show "a = b" by simp next fix a b c assume "a b" "b c" then have "a = a b" "b = b c"

23 May 2024: subset.chain 𝒜 𝒞 = (𝒞 𝒜 (X𝒞. Y𝒞. X Y Y X))" by (auto simp: subset.chain_def) lemma subset_chain_insert: "subset.chain 𝒜 (insert B ) B 𝒜 (X. ... S" and 2: "AC. BC. A B B A" for C proof - let?

23 May 2024: simp lemma set_mset_empty [simp]: "by (simp add: set_mset_def) lemma set_mset_single: "set_mset {#b#} = {b}" by (simp add: set_mset_def) lemma ... Mx A" by (where x = "Mx#}"]) simp lemma multiset_add_sub_el_shuffle: assumes "c # B" and "b c" shows

23 May 2024: c)(Split(d))" definition List_rec :: "['a item, 'b, ['a item, 'a item, 'b]=>'b] => 'b" where "List_rec M c dg. ... ML ) list_rec :: "['a list, 'b, ['a, 'a list, 'b]=>'b] => 'b" where "list_rec l c dl) c (%x y r.

23 May 2024: iff: "principal a = principal b a b b a" unfolding po_eq_conv [where 'a='b] principal_below_iff. ... principal a = Abs {b. b a}" assumes countable: "f::'af" shows "ideal_completion r principal Rep" proof interpret type_definition Rep Abs "{S.

23 May 2024: assumes "bound0 p" shows "Ifm bbs (b # bs) pbbs (b' # bs) p" usingwhere b="b" and bs="bs" and b'="b'"] by (induct p rule:simp add: gr0_conv_Suc) fun ... I': "numbound0 a Inum (b#bs) (numsubst0 a t)b'#bs) a)#bs) t" by (induct t rule:simp:where b="b" and b'

23 May 2024: bB. x b j) (x = t) (x - D = t))" "⟦Dt B⟧ ((x::jD}. ... bB. x b j) (x t) (x - D t))" "⟦Dt B⟧ ((x::jD}.

23 May 2024: locale semigroup = fixes f :: "'a 'a 'a" (infixl "" 70) assumes assoc [ac_simps]: "a b c = a (b c)" locale abel_semigroup = semigroup assumes commute [ac_simps]: "a b = b a" ... standard (fact add_assoc) declareend hide_fact add_assoc class

23 May 2024: ASCII) "_sum_list" :: "pttrn => 'a list => 'b => 'b" ("(3SUM _<-_. _)" [0, 51, 10] 10) syntax "_sum_list" :: "pttrn => 'a list => 'b => 'b" ("(3__. _)" ... b" ("(3PROD _<-_. _)" [0, 51, 10] 10) syntax "_prod_list" :: "pttrn => 'a list => 'b => 'b" ("(3__.

23 May 2024: assumes group_hom: "group_hom G (BijGroup E) φ" definition orbit :: "[_, 'a 'b 'b, 'b] 'b set" where "orbit G φ x = {(φ g) x | g. ... x E}" definition stabilizer :: "[_, 'a 'b 'b, 'b] 'a set" where "stabilizer G φ x = {g carrier G. (

23 May 2024: A a u B b) apply (case_tac "A = B") apply simp apply simp apply (apply clarify apply (rename_tac A a u B b) apply (case_tac "A = B") apply ... rotate_tac -1) apply simp apply (rotate_tac -1) apply (case_tac "B = C") apply simp apply (rotate_tac -1) apply

23 May 2024: lemma wf_onI_pf: assumes "B. B A B R B Bshows "wf_on A R" unfolding wf_on_def proof (introfix P :: "'a bool" and x :: 'a let? ... a 'a) set ('b 'b) set (('a 'b) ('a 'b)) set" (infixr "<lex>" 80) where "ra <lex> rb = {((a, b), (a', b')).

23 May 2024: a. a A - b! b'. b' B - {b} a b'" using unique_class by fastforce next show "b'. ... b' B - {b} b' A - b" usingby fastforce qed lemma disjoint_sum: ‹contributor ‹Paulo Emílio de Vilhena›› "⟦ finite B; finite A; partition A B⟧ (bB.

23 May 2024: and "a b" "b a" shows "P" using assms by (elimlemma (in weak_partial_order) lless_trans [trans]: assumes "a b" "b c" and carr[simp]: "aL" "bL" "cL" shows "a ... add:subsubsection ‹Idempotent functions› definition idempotent :: "('a, 'b) gorder_scheme

23 May 2024: B; u A; v B⟧ A B" by (lemma insert_lepoll_cong: assumes "A B" "b B" shows "insert a Ab B" proof - obtain f where f: "inj_on f A" ... where "inj_on f A" "f A B" using assms by (then obtain b where b: "b B" "b f A" by auto show?

23 May 2024: mk_disjoint_insert by fastforce lemma fst_Pi: "A B A" and snd_Pi: "A B B" by auto subsection ‹Composition With a Restricted Domain: <term>‹compose›› lemma funcset_compose: "f ... E. x{a}. B x) = (b B a. {λx {a}. b})" apply (auto simp: PiE_iff

23 May 2024: f aa" definition zero_l_neutral :: "('a::zero 'b 'b) bool" where "zero_l_neutral f == a. ... fmul fadd A B" by simp qed definition r_distributive :: "('a 'b 'b) ('b 'b 'b) bool" where "r_distributive fmul fadd == a u v.

23 May 2024: f b b}" by auto interpret bijection f by‹bij f›) from fin show "f)a. ... f b b}" then have "bij f" by simp interpret bijection f by‹bij f›) show "{a.

23 May 2024: b1 'a 'b2 ('a, 'b1, 'b2) F2 = unit 'b1 'b2 ) locale loc = fixes c :: 'a and d :: 'a assumes "c d" begin datatype (discs_sels) 'b I1 = I11 'b "'b I1" | ... I12 'b "'b I2" and 'b I2 = I21 | I22 "'b I1" "'b I2" datatype (discs_sels) 'b tree = TEmpty | TNode

23 May 2024: b xb (x / b b)" using that by simp also have "…b (x / b)b b" using that by (also have "…b (x / b)using that by simp also have "b ... x / b)b (x div b (x / b - x div b))" by simp also have "…b (x div b)" usingby (introfinally show?

23 May 2024: Pz = x) (Pz = y))" definition Let :: "'a ('a 'b) 'b" where "Let s f f s" translations "_Let (_binds b bs) e" "_Let b (_Let bs e)" "let x = a in ... lemma not_sym: "t s s t" by (erule contrapos_nn) (erule sym) lemma eq_neq_eq_imp_neq: "⟦x = a; a b; b =