intro H2; cases (H10 ? H2);
cases (H (w1+j)); apply (H11 H7);
qed.
-
+
(* Theorem 3.10 *)
theorem lebesgue_oc:
∀C:ordered_uniform_space.
[1: apply (le_transitive ???? (H8 0)); cases (Hyi 0); assumption
|2: apply (le_transitive ????? (H4 0)); cases (Hxi 0); assumption]
|2: intros 3 (h);
- letin Xi ≝ (⌊n,≪xi n,Hxi n≫⌋);
- letin Yi ≝ (⌊n,≪yi n,Hyi n≫⌋);
- letin Ai ≝ (⌊n,≪a n,H1 n≫⌋);
- apply (sandwich {[l,u]} ≪?,h≫ Xi Yi Ai); try assumption;
+ letin Xi ≝ (⌊n,≪xi n, Hxi n≫⌋);
+ letin Yi ≝ (⌊n,≪yi n, Hyi n≫⌋);
+ letin Ai ≝ (⌊n,≪a n, H1 n≫⌋);
+ apply (sandwich {[l,u]} ≪?, h≫ Xi Yi Ai); try assumption;
[1: intro j; cases (Hxy j); cases H3; cases H4; split;
[apply (H5 0);|apply (H7 0)]
|2: cases (H l u Xi ≪?,h≫) (Ux Uy); apply Ux; cases Hx; split; [apply H3;]
|2: intros 3;
lapply (uparrow_upperlocated ? xi x Hx)as Ux;
lapply (downarrow_lowerlocated ? yi x Hy)as Uy;
- letin Xi ≝ (⌊n,≪xi n,Hxi n≫⌋);
- letin Yi ≝ (⌊n,≪yi n,Hyi n≫⌋);
- letin Ai ≝ (⌊n,≪a n,H1 n≫⌋);
- apply (sandwich {[l,u]} ≪x,h≫ Xi Yi Ai); try assumption;
+ letin Xi ≝ (⌊n,≪xi n, Hxi n≫⌋);
+ letin Yi ≝ (⌊n,≪yi n, Hyi n≫⌋);
+ letin Ai ≝ (⌊n,≪a n, H1 n≫⌋);
+ apply (sandwich {[l,u]} ≪?, h≫ Xi Yi Ai); try assumption;
[1: intro j; cases (Hxy j); cases H3; cases H4; split;
[apply (H5 0);|apply (H7 0)]
|2: cases (restrict_uniform_convergence_uparrow ? S ?? (H l u) Xi x Hx);