Search

4 Jun 2024: Venue: Council Room, Murray Edwards College (meet at porter’s lodge at 2pm for a 2:15pm start)/div divb/b/div divbiLiteraryspan class="markl40ibvki8" data-markjs="true" data-ogac="" ... There are a few spaces remaining, so please do sign up if you are

8 Apr 2024: The clubs and societies listed here are currently registered with the Junior Proctor under the University regulations for 'Clubs and Societies' (Statutes and Ordinances, Chapter II: Matriculation, Residence, Admission to Degrees, Discipline).

23 May 2024: qed from wfactors_factors[OFobtain b' where fb': "factors G bs b'" and b': "b' b" by blast fromhave b'carr[simp]: "b'G" by fast have b'nunit: "b'G" ... asf': "factors G as a'" and a'a: "a' a" and bsf': "factors G bs b'" and b'b: "b' b" from asf' have

4 Jun 2024: Venue: Council Room, Murray Edwards College (meet at porter’s lodge at 2pm for a 2:15pm start)/div divb/b/div divbiLiteraryspan class="markl40ibvki8" data-markjs="true" data-ogac="" ... There are a few spaces remaining, so please do sign up if you are

29 May 2024: Home page Indexes: The Girton Poetry Group. Not Averse. Concordance. This concordance provides an index to every word in the poems, excluding a list of common "stopwords". It may be useful in finding a half-remembered poem, and perhaps in looking at

23 May 2024: Instead of order topology.) ) assumes ‹(f has_sum a) A› and "(g has_sum b) B" assumes ‹x. ... x A - B f xshows "sum f B S" by (lemma finite_sum_le_infsum: fixes f :: "'a 'b::{assumes "f summable_on A" "finite B" "B A" assumes "x.

23 May 2024: B(x)); x. ⟦x:A; b: B(x)⟧ R⟧ R" unfolding UNION_def by (blast dest: CollectD elim: bexE) lemma UN_cong: "⟦A = B; x. ... B(x)); b: B(a) R; a:A R⟧ R" unfolding INTER_def by (blast dest:lemma INT_cong: "⟦A = B; x.

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: thesis by (qed show? thesis usingby (qed lemma SR_B_inj: "inj_on (λx. ... E: "using finite_E by (simp add:lemma C_card_eq_B: "proof - have "inj_on (λx.

23 May 2024: A)" ― ‹legacy› section ‹Quantifier elimination for ‹ (0, 1, , floor, <)›› declare of_int_floor_cancel [simp del] lemma myle: fixes a b :: "'a::{ordered_ab_group_add}" shows "(a b)b - a)" ... by (lemma myless: fixes a b ::

23 May 2024: b B ⟨b',b⟩:s" by (unfoldlemma radd_Inr_Inl_iff [simp]: "⟨Inr(b), Inl(a)⟩A,r,B,s)by (unfolddeclare radd_Inr_Inl_iff [THENsubsubsection‹Elimination Rule› lemma raddE: ... Can be used to obtain introduction rules› lemma rmult_iff [iff]:

23 May 2024: B x) a A b B a" by auto lemma INT_E [elim]: "b (xA. ... A B))" "AA else (B. B A))" by auto lemma Un_Union_image: "(xC.

23 May 2024: and (Haskell) infixr 9 "." subsection ‹The Forward Composition Operator ‹fcomp›› definition fcomp :: "('a 'b) ('b 'c) 'a 'c" (infixl ">" 60) where "f > g = (λx.

23 May 2024: T (Rep b) b) R = TT" unfoldingby auto lemma Quotient_alt_def5: "Quotient R Abs Rep T TAbsRep TR = T OO T" unfoldingby blast lemma fun_quotient: assumes 1: "Quotient R1 ... correspondence relation› definition POS :: "('a 'b bool) ('a 'bwhere "POS A B A B

23 May 2024: transfer by simp lift_definition ffold :: "('a 'b 'b) 'b 'a fset 'b" is Finite_Set.fold. ... A || C" by (lemma fsubset_pfsubset_trans: "A || B B || C A || C" by (lemma pfsubset_imp_ex_fmem: "A || B b.

23 May 2024: a B b B xB. F xF a) (F b)) eventually P (bB. ... F. B) B" unfoldingby (force intro: eventually_True) lemma prod_filter_INF: assumes "Iand "Jshows "(iI.

23 May 2024: a,a'ra; pa,ba',b'⟧ R" and 3: "a b b'. ⟦<b,b'rb; pa,ba,b'⟧ R" shows R apply (THEN lexXH [THEN iffD1], THEN exE]) usingapply blast done ... induct]) apply (apply (apply (erule 2) apply blast done lemma SPLITB: "a,b>,B) = B(a,b)" unfolding SPLIT_def

23 May 2024: FROM the responder) | K6: "⟦ evs6 kerbIV; Says A' B ⦃ (B) ⦃Agent A, Agent B, Key servK, Number Ts⦄), (Crypt servK ⦃Agent A, Number T3⦄)⦄evs6;Ts evs6;T3 evs6 ⟧ Says B ... evs); Key SesKeyevs); evs⟧ K=K' B=B' T=T' Ticket=Ticket'" apply

23 May 2024: a, b], [b, b], [c, b], [a, c], [b, c], [c, c]]" by (simp add: eval_nat_numeral)} @{lemma "rotate1 [a,b,c,d] = [b,c,d,a]" by simp} @{lemma ... b 'b list 'b list" where "insort_insert_key f x xsf x fxs then xsf x xs)" abbreviation "sort sort_key (λx.

23 May 2024: a A b B}" definition refl' :: "('a 'a)where "refl' r x. ... set xs = Axs))inductive fold_graph' :: "('a 'b 'b) 'b 'a set 'b bool" where "fold_graph' f z {} z" | "⟦x A; fold_graph' f z (A - {x}) y⟧ fold_graph'