Skip to content

Commit 731018d

Browse files
committed
adapt to coq#19611
1 parent 97d0779 commit 731018d

File tree

1 file changed

+18
-19
lines changed

1 file changed

+18
-19
lines changed

theories/tvs.v

Lines changed: 18 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -72,39 +72,38 @@ HB.structure Definition Tvs (R : numDomainType) :=
7272
{E of Uniform_isTvs R E & Uniform E & GRing.Lmodule R E}.
7373

7474
Section properties_of_topologicallmodule.
75-
Context (R : numDomainType) (E : topologicalType)
76-
(Me : GRing.Lmodule R E) (U : set E).
77-
Let ME := GRing.Lmodule.Pack Me.
75+
Context (R : numDomainType) (E : TopologicalLmodule.type R)
76+
(U : set E).
7877

79-
Lemma nbhsN_subproof (f : continuous (fun z : R^o * E => z.1 *: (z.2 : ME))) (x : E) :
80-
nbhs x U -> nbhs (-(x:ME)) (-%R @` (U : set ME)).
78+
Lemma nbhsN_subproof (f : continuous (fun z : R^o * E => z.1 *: z.2)) (x : E) :
79+
nbhs x U -> nbhs (-x) (-%R @` U).
8180
Proof.
82-
move=> Ux; move: (f (-1, - (x:ME)) U); rewrite /= scaleN1r opprK => /(_ Ux) [] /=.
83-
move=> [B] B12 [B1 B2] BU; near=> y; exists (- (y:ME)); rewrite ?opprK// -scaleN1r//.
81+
move=> Ux; move: (f (-1, -x) U); rewrite /= scaleN1r opprK => /(_ Ux) [] /=.
82+
move=> [B] B12 [B1 B2] BU; near=> y; exists (- y); rewrite ?opprK// -scaleN1r//.
8483
apply: (BU (-1, y)); split => /=; last by near: y.
8584
by move: B1 => [] ? ?; apply => /=; rewrite subrr normr0.
8685
Unshelve. all: by end_near. Qed.
8786

88-
Lemma nbhs0N_subproof (f : continuous (fun z : R^o * E => z.1 *: (z.2:ME) : E)) :
89-
nbhs (0 :ME) (U : set ME) -> nbhs (0 : ME) (-%R @` (U : set ME)).
87+
Lemma nbhs0N_subproof (f : continuous (fun z : R^o * E => z.1 *: z.2)) :
88+
nbhs 0 U -> nbhs 0 (-%R @` U).
9089
Proof. by move => Ux; rewrite -oppr0; exact: nbhsN_subproof. Qed.
9190

92-
Lemma nbhsT_subproof (f : continuous (fun x : E * E => (x.1 : ME) + (x.2 : ME))) (x : E) :
93-
nbhs (0 : ME) U -> nbhs (x : ME) (+%R (x : ME) @` U).
91+
Lemma nbhsT_subproof (f : continuous (fun x : E * E => x.1 + x.2)) (x : E) :
92+
nbhs 0 U -> nbhs x (+%R x @` U).
9493
Proof.
95-
move => U0; have /= := f (x, -(x : ME)) U; rewrite subrr => /(_ U0).
94+
move => U0; have /= := f (x, -x) U; rewrite subrr => /(_ U0).
9695
move=> [B] [B1 B2] BU; near=> x0.
97-
exists ((x0 : ME) - (x : ME)); last by rewrite addrCA subrr addr0.
98-
by apply: (BU ((x0 : ME), -(x : ME))); split; [near: x0; rewrite nearE|exact: nbhs_singleton].
96+
exists (x0 - x); last by rewrite addrCA subrr addr0.
97+
by apply: (BU (x0, -x)); split; [near: x0; rewrite nearE|exact: nbhs_singleton].
9998
Unshelve. all: by end_near. Qed.
10099

101-
Lemma nbhsB_subproof (f : continuous (fun x : E * E => (x.1 : ME) + (x.2 : ME))) (z x : E) :
102-
nbhs (z : ME) U -> nbhs ((x : ME) + (z : ME)) (+%R (x : ME) @` U).
100+
Lemma nbhsB_subproof (f : continuous (fun x : E * E => x.1 + x.2)) (z x : E) :
101+
nbhs z U -> nbhs (x + z) (+%R x @` U).
103102
Proof.
104-
move=> U0; move: (@f ((x : ME) + (z : ME), -(x : ME)) U); rewrite /= addrAC subrr add0r.
103+
move=> U0; move: (@f (x + z, -x) U); rewrite /= addrAC subrr add0r.
105104
move=> /(_ U0)[B] [B1 B2] BU; near=> x0.
106-
exists ((x0 : ME) - (x : ME)); last by rewrite addrCA subrr addr0.
107-
by apply: (BU ((x0 : ME), -(x : ME))); split; [near: x0; rewrite nearE|exact: nbhs_singleton].
105+
exists (x0 - x); last by rewrite addrCA subrr addr0.
106+
by apply: (BU (x0, -x)); split; [near: x0; rewrite nearE|exact: nbhs_singleton].
108107
Unshelve. all: by end_near. Qed.
109108

110109
End properties_of_topologicallmodule.

0 commit comments

Comments
 (0)