|5: cases (with_ X); simplify; apply (us_phi4 (ous_us_ X))]
qed.
-coercion cic:/matita/dama/ordered_uniform/ous_unifspace.con.
+coercion ous_unifspace.
record ordered_uniform_space : Type ≝ {
ous_stuff :> ordered_uniform_space_;
intros; split; exists; [1: apply (\fst x) |3: apply (\snd x)] assumption;
qed.
-coercion cic:/matita/dama/ordered_uniform/segment_square_of_ordered_set_square.con 0 2.
+coercion segment_square_of_ordered_set_square with 0 2.
-alias symbol "pi1" (instance 4) = "sigT \fst".
-alias symbol "pi1" (instance 2) = "sigT \fst".
+alias symbol "pi1" (instance 4) = "exT \fst".
+alias symbol "pi1" (instance 2) = "exT \fst".
lemma ordered_set_square_of_segment_square :
∀O:ordered_set.∀u,v:O.{[u,v]} square → O square ≝
λO:ordered_set.λu,v:O.λb:{[u,v]} square.〈\fst(\fst b),\fst(\snd b)〉.
-coercion cic:/matita/dama/ordered_uniform/ordered_set_square_of_segment_square.con.
+coercion ordered_set_square_of_segment_square.
lemma restriction_agreement :
∀O:ordered_uniform_space.∀l,r:O.∀P:{[l,r]} square → Prop.∀OP:O square → Prop.Prop.
notation < "x \sub \neq" with precedence 91 for @{'bsss $x}.
interpretation "bs_of_ss" 'bsss x = (bs_of_ss _ _ _ x).
-alias symbol "square" (instance 7) = "ordered set square".
-alias symbol "square" (instance 13) = "ordered set square".
-alias symbol "dependent_pair" = "dependent set".
lemma ss_of_bs:
∀O:ordered_set.∀u,v:O.
∀b:O square.\fst b ∈ [u,v] → \snd b ∈ [u,v] → {[u,v]} square ≝
(segment_ordered_uniform_space _ a b).
(* Lemma 3.2 *)
-alias symbol "pi1" = "sigT \fst".
+alias symbol "pi1" = "exT \fst".
lemma restric_uniform_convergence:
∀O:ordered_uniform_space.∀l,u:O.
∀x:{[l,u]}.