Theorem iscusp2 23362

Description: The predicate "𝑊 is a complete uniform space." (Contributed by Thierry Arnoux, 15-Dec-2017.)

Hypotheses

Ref	Expression
iscusp2.1	⊢ 𝐵 = (Base‘𝑊)
iscusp2.2	⊢ 𝑈 = (UnifSt‘𝑊)
iscusp2.3	⊢ 𝐽 = (TopOpen‘𝑊)

Assertion

Ref	Expression
iscusp2	⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)))

Distinct variable group:   𝑊,𝑐

Allowed substitution hints:   𝐵(𝑐)   𝑈(𝑐)   𝐽(𝑐)

Proof of Theorem iscusp2

Step	Hyp	Ref	Expression
1		iscusp 23359	. 2 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
2		iscusp2.1	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
3	2	fveq2i 6759	. . . 4 ⊢ (Fil‘𝐵) = (Fil‘(Base‘𝑊))
4		iscusp2.2	. . . . . . 7 ⊢ 𝑈 = (UnifSt‘𝑊)
5	4	fveq2i 6759	. . . . . 6 ⊢ (CauFilu‘𝑈) = (CauFilu‘(UnifSt‘𝑊))
6	5	eleq2i 2830	. . . . 5 ⊢ (𝑐 ∈ (CauFilu‘𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)))
7		iscusp2.3	. . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝑊)
8	7	oveq1i 7265	. . . . . 6 ⊢ (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐)
9	8	neeq1i 3007	. . . . 5 ⊢ ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)
10	6, 9	imbi12i 350	. . . 4 ⊢ ((𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
11	3, 10	raleqbii 3160	. . 3 ⊢ (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
12	11	anbi2i 622	. 2 ⊢ ((𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)) ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
13	1, 12	bitr4i 277	1 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  ∅c0 4253  ‘cfv 6418  (class class class)co 7255  Basecbs 16840  TopOpenctopn 17049  Filcfil 22904   fLim cflim 22993  UnifStcuss 23313  UnifSpcusp 23314  CauFil_uccfilu 23346  CUnifSpccusp 23357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-iota 6376  df-fv 6426  df-ov 7258  df-cusp 23358

This theorem is referenced by:  cmetcusp1  24422