Theorem iscusp2 24511

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 24508	. 2 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
2		iscusp2.1	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
3	2	fveq2i 6888	. . . 4 ⊢ (Fil‘𝐵) = (Fil‘(Base‘𝑊))
4		iscusp2.2	. . . . . . 7 ⊢ 𝑈 = (UnifSt‘𝑊)
5	4	fveq2i 6888	. . . . . 6 ⊢ (CauFilu‘𝑈) = (CauFilu‘(UnifSt‘𝑊))
6	5	eleq2i 2857	. . . . 5 ⊢ (𝑐 ∈ (CauFilu‘𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)))
7		iscusp2.3	. . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝑊)
8	7	oveq1i 7429	. . . . . 6 ⊢ (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐)
9	8	neeq1i 3024	. . . . 5 ⊢ ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)
10	6, 9	imbi12i 353	. . . 4 ⊢ ((𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
11	3, 10	raleqbii 3338	. . 3 ⊢ (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
12	11	anbi2i 635	. 2 ⊢ ((𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)) ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
13	1, 12	bitr4i 281	1 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∀wral 3081  ∅c0 4286  ‘cfv 6540  (class class class)co 7419  Basecbs 17293  TopOpenctopn 17498  Filcfil 24055   fLim cflim 24144  UnifStcuss 24463  UnifSpcusp 24464  CauFil_uccfilu 24495  CUnifSpccusp 24506

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-cusp 24507

This theorem is used by:  cmetcusp1  25565