Theorem cuspcvg 22513

Description: In a complete uniform space, any Cauchy filter 𝐶 has a limit. (Contributed by Thierry Arnoux, 3-Dec-2017.)

Hypotheses

Ref	Expression
cuspcvg.1	⊢ 𝐵 = (Base‘𝑊)
cuspcvg.2	⊢ 𝐽 = (TopOpen‘𝑊)

Assertion

Ref	Expression
cuspcvg	⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐽 fLim 𝐶) ≠ ∅)

Proof of Theorem cuspcvg

Dummy variable 𝑐 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2847	. . . . 5 ⊢ (𝑐 = 𝐶 → (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) ↔ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊))))
2		cuspcvg.2	. . . . . . . . 9 ⊢ 𝐽 = (TopOpen‘𝑊)
3	2	eqcomi 2787	. . . . . . . 8 ⊢ (TopOpen‘𝑊) = 𝐽
4	3	a1i 11	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (TopOpen‘𝑊) = 𝐽)
5		id 22	. . . . . . 7 ⊢ (𝑐 = 𝐶 → 𝑐 = 𝐶)
6	4, 5	oveq12d 6940	. . . . . 6 ⊢ (𝑐 = 𝐶 → ((TopOpen‘𝑊) fLim 𝑐) = (𝐽 fLim 𝐶))
7	6	neeq1d 3028	. . . . 5 ⊢ (𝑐 = 𝐶 → (((TopOpen‘𝑊) fLim 𝑐) ≠ ∅ ↔ (𝐽 fLim 𝐶) ≠ ∅))
8	1, 7	imbi12d 336	. . . 4 ⊢ (𝑐 = 𝐶 → ((𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅) ↔ (𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) → (𝐽 fLim 𝐶) ≠ ∅)))
9		iscusp 22511	. . . . . 6 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
10	9	simprbi 492	. . . . 5 ⊢ (𝑊 ∈ CUnifSp → ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
11	10	adantr 474	. . . 4 ⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
12		simpr 479	. . . . 5 ⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → 𝐶 ∈ (Fil‘𝐵))
13		cuspcvg.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝑊)
14	13	fveq2i 6449	. . . . 5 ⊢ (Fil‘𝐵) = (Fil‘(Base‘𝑊))
15	12, 14	syl6eleq 2869	. . . 4 ⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → 𝐶 ∈ (Fil‘(Base‘𝑊)))
16	8, 11, 15	rspcdva 3517	. . 3 ⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) → (𝐽 fLim 𝐶) ≠ ∅))
17	16	3impia 1106	. 2 ⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵) ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊))) → (𝐽 fLim 𝐶) ≠ ∅)
18	17	3com23 1117	1 ⊢ ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐽 fLim 𝐶) ≠ ∅)

Syntax hints:   → wi 4   ∧ wa 386   ∧ w3a 1071   = wceq 1601   ∈ wcel 2107   ≠ wne 2969  ∀wral 3090  ∅c0 4141  ‘cfv 6135  (class class class)co 6922  Basecbs 16255  TopOpenctopn 16468  Filcfil 22057   fLim cflim 22146  UnifStcuss 22465  UnifSpcusp 22466  CauFil_uccfilu 22498  CUnifSpccusp 22509

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3400  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4672  df-br 4887  df-iota 6099  df-fv 6143  df-ov 6925  df-cusp 22510

This theorem is referenced by:  cnextucn  22515