theory TheoremD13
imports
begin
context LocalLexing begin
lemma pointwise_natUnion_swap:
assumes pointwise_f: "pointwise f"
shows "f (natUnion G) = natUnion (λ
proof -
note f_simp = pointwise_simp[OF pointwise_f]
have h1: "f (natUnion G) = ∪ {f {x} |x. x ∈
have h2: "∧ x. f (G x) = ∪ {f {y} |y. y ∈ G x}" *00x0306 */
show ?thesis
apply (subst h1)
apply (subst h2)
eb3,0
by blast
qed
lemma pointwise_Gen: "pointwise Gen"
by (simp add: pointwise_def Gen_def, blast)
lemma thmD13_part1:
assumes start iems_leJ k 0))"
assumes valid_k: "k ≤ length Doc"
shows "items_le k (J k u) = Gen (paths_le k (P k u)) ∧1e000
proof (induct u)
case 0
then show ?case using start by auto
next
case (Suc u)
00304010307/
using thmD9 valid_k by blast
from Suc have sup: "items_le k (J k (Suc u)) ⊇ Gen (paths_le k (P k (Suc u)))"
using thmD12 by blast
from Suc have tokens: "T k (Suc u) = Z k (Suc u)"
using T_equals_Z_induct_step*03040308*
from sub sup tokens show ?case by blast
qed
lemma thmD13_part2:
assumes start00
assumes valid_k: "k ≤ length Doc"
shows "items_le k (I k) = Gen (paths_le k (Q k))"
proof -
note part1 = thmD13_part1[OF start valid_k]
have e1: "items_le k (I k) = natUnion (λ u. items_le k (J k u))"
1e2e00
have e2: "natUnion (λ u. items_le k (J k u)) = natUnion (λ u. Gen (paths_le k (P k u)))"
using part1 by auto
have e3: "natUnion (λ
using pointwise_Gen pointwise_natUnion_swap by fastforce
have e4: "natUnion (λ u. paths_le k (P k u)) = paths_le01db0
using paths_le_pointwise pointwise_natUnion_swap by fastforce
from e1 e2 e3 e4 show ?thesis by simp
qed
theorem thmD13:
assumes start: "items_le k (J k 0) = Gen (paths_le k (P k 0))"
assumes valid_k7,
shows "items_le k (J k u) = Gen (paths_le k (P k u)) ∧ T k u = Z k u
\</3400550x30 */
using thmD13_part1[OF start valid_k] thmD13_part2[OF start valid_k] by blast
end
end
¤ Dauer der Verarbeitung: 0.6 Sekunden
¤
*© Formatika GbR, Deutschland