Theorem locfinbas 23868

Description: A locally finite cover must cover the base set of its corresponding topological space. (Contributed by Jeff Hankins, 21-Jan-2010.)

Hypotheses

Ref	Expression
locfinbas.1	⊢ 𝑋 = ∪ 𝐽
locfinbas.2	⊢ 𝑌 = ∪ 𝐴

Assertion

Ref	Expression
locfinbas	⊢ (𝐴 ∈ (LocFin‘𝐽) → 𝑋 = 𝑌)

Proof of Theorem locfinbas

Dummy variables 𝑛 𝑠 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		locfinbas.1	. . 3 ⊢ 𝑋 = ∪ 𝐽
2		locfinbas.2	. . 3 ⊢ 𝑌 = ∪ 𝐴
3	1, 2	islocfin 23863	. 2 ⊢ (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑠 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑠 ∈ 𝑛 ∧ {𝑥 ∈ 𝐴 ∣ (𝑥 ∩ 𝑛) ≠ ∅} ∈ Fin)))
4	3	simp2bi 1164	1 ⊢ (𝐴 ∈ (LocFin‘𝐽) → 𝑋 = 𝑌)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416   ∩ cin 4092  ∅c0 4281  ∪ cuni 4870  ‘cfv 6555  Fincfn 8998  Topctop 23238  LocFinclocfin 23850

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fv 6563  df-top 23239  df-locfin 23853

This theorem is used by:  lfinpfin  23870  lfinun  23871  locfincmp  23872  locfindis  23876  locfincf  23877