Theorem locfinbas 23690

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 23685	. 2 ⊢ (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑠 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑠 ∈ 𝑛 ∧ {𝑥 ∈ 𝐴 ∣ (𝑥 ∩ 𝑛) ≠ ∅} ∈ Fin)))
4	3	simp2bi 1163	1 ⊢ (𝐴 ∈ (LocFin‘𝐽) → 𝑋 = 𝑌)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3415   ∩ cin 3903  ∅c0 4285  ∪ cuni 4871  ‘cfv 6536  Fincfn 8941  Topctop 23061  LocFinclocfin 23672

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fv 6544  df-top 23062  df-locfin 23675

This theorem is used by:  lfinpfin  23692  lfinun  23693  locfincmp  23694  locfindis  23698  locfincf  23699