Theorem locfinbas 23749

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3414   ∩ cin 3901  ∅c0 4282  ∪ cuni 4870  ‘cfv 6537  Fincfn 8955  Topctop 23119  LocFinclocfin 23731

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2100  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 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-top 23120  df-locfin 23734

This theorem is used by:  lfinpfin  23751  lfinun  23752  locfincmp  23753  locfindis  23757  locfincf  23758