Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  islocfin Structured version   Visualization version   GIF version

Theorem islocfin 21230
 Description: The statement "is a locally finite cover." (Contributed by Jeff Hankins, 21-Jan-2010.)
Hypotheses
Ref Expression
islocfin.1 𝑋 = 𝐽
islocfin.2 𝑌 = 𝐴
Assertion
Ref Expression
islocfin (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
Distinct variable groups:   𝑛,𝑠,𝑥,𝐴   𝑛,𝐽,𝑥   𝑥,𝑋
Allowed substitution hints:   𝐽(𝑠)   𝑋(𝑛,𝑠)   𝑌(𝑥,𝑛,𝑠)

Proof of Theorem islocfin
Dummy variables 𝑗 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-locfin 21220 . . . . 5 LocFin = (𝑗 ∈ Top ↦ {𝑦 ∣ ( 𝑗 = 𝑦 ∧ ∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
21dmmptss 5590 . . . 4 dom LocFin ⊆ Top
3 elfvdm 6177 . . . 4 (𝐴 ∈ (LocFin‘𝐽) → 𝐽 ∈ dom LocFin)
42, 3sseldi 3581 . . 3 (𝐴 ∈ (LocFin‘𝐽) → 𝐽 ∈ Top)
5 eqimss2 3637 . . . . . . . . . . 11 (𝑋 = 𝑦 𝑦𝑋)
6 sspwuni 4577 . . . . . . . . . . 11 (𝑦 ⊆ 𝒫 𝑋 𝑦𝑋)
75, 6sylibr 224 . . . . . . . . . 10 (𝑋 = 𝑦𝑦 ⊆ 𝒫 𝑋)
8 selpw 4137 . . . . . . . . . 10 (𝑦 ∈ 𝒫 𝒫 𝑋𝑦 ⊆ 𝒫 𝑋)
97, 8sylibr 224 . . . . . . . . 9 (𝑋 = 𝑦𝑦 ∈ 𝒫 𝒫 𝑋)
109adantr 481 . . . . . . . 8 ((𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) → 𝑦 ∈ 𝒫 𝒫 𝑋)
1110abssi 3656 . . . . . . 7 {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ⊆ 𝒫 𝒫 𝑋
12 islocfin.1 . . . . . . . . 9 𝑋 = 𝐽
1312topopn 20636 . . . . . . . 8 (𝐽 ∈ Top → 𝑋𝐽)
14 pwexg 4810 . . . . . . . 8 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
15 pwexg 4810 . . . . . . . 8 (𝒫 𝑋 ∈ V → 𝒫 𝒫 𝑋 ∈ V)
1613, 14, 153syl 18 . . . . . . 7 (𝐽 ∈ Top → 𝒫 𝒫 𝑋 ∈ V)
17 ssexg 4764 . . . . . . 7 (({𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ⊆ 𝒫 𝒫 𝑋 ∧ 𝒫 𝒫 𝑋 ∈ V) → {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ∈ V)
1811, 16, 17sylancr 694 . . . . . 6 (𝐽 ∈ Top → {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ∈ V)
19 unieq 4410 . . . . . . . . . . 11 (𝑗 = 𝐽 𝑗 = 𝐽)
2019, 12syl6eqr 2673 . . . . . . . . . 10 (𝑗 = 𝐽 𝑗 = 𝑋)
2120eqeq1d 2623 . . . . . . . . 9 (𝑗 = 𝐽 → ( 𝑗 = 𝑦𝑋 = 𝑦))
22 rexeq 3128 . . . . . . . . . 10 (𝑗 = 𝐽 → (∃𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
2320, 22raleqbidv 3141 . . . . . . . . 9 (𝑗 = 𝐽 → (∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
2421, 23anbi12d 746 . . . . . . . 8 (𝑗 = 𝐽 → (( 𝑗 = 𝑦 ∧ ∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) ↔ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
2524abbidv 2738 . . . . . . 7 (𝑗 = 𝐽 → {𝑦 ∣ ( 𝑗 = 𝑦 ∧ ∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} = {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
2625, 1fvmptg 6237 . . . . . 6 ((𝐽 ∈ Top ∧ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ∈ V) → (LocFin‘𝐽) = {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
2718, 26mpdan 701 . . . . 5 (𝐽 ∈ Top → (LocFin‘𝐽) = {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
2827eleq2d 2684 . . . 4 (𝐽 ∈ Top → (𝐴 ∈ (LocFin‘𝐽) ↔ 𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))}))
29 elex 3198 . . . . . 6 (𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} → 𝐴 ∈ V)
3029adantl 482 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))}) → 𝐴 ∈ V)
31 simpr 477 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
32 islocfin.2 . . . . . . . . . 10 𝑌 = 𝐴
3331, 32syl6eq 2671 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 = 𝐴)
3413adantr 481 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋𝐽)
3533, 34eqeltrrd 2699 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴𝐽)
36 elex 3198 . . . . . . . 8 ( 𝐴𝐽 𝐴 ∈ V)
3735, 36syl 17 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴 ∈ V)
38 uniexb 6921 . . . . . . 7 (𝐴 ∈ V ↔ 𝐴 ∈ V)
3937, 38sylibr 224 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴 ∈ V)
4039adantrr 752 . . . . 5 ((𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))) → 𝐴 ∈ V)
41 unieq 4410 . . . . . . . . 9 (𝑦 = 𝐴 𝑦 = 𝐴)
4241, 32syl6eqr 2673 . . . . . . . 8 (𝑦 = 𝐴 𝑦 = 𝑌)
4342eqeq2d 2631 . . . . . . 7 (𝑦 = 𝐴 → (𝑋 = 𝑦𝑋 = 𝑌))
44 rabeq 3179 . . . . . . . . . . 11 (𝑦 = 𝐴 → {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} = {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅})
4544eleq1d 2683 . . . . . . . . . 10 (𝑦 = 𝐴 → ({𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin ↔ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
4645anbi2d 739 . . . . . . . . 9 (𝑦 = 𝐴 → ((𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
4746rexbidv 3045 . . . . . . . 8 (𝑦 = 𝐴 → (∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
4847ralbidv 2980 . . . . . . 7 (𝑦 = 𝐴 → (∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
4943, 48anbi12d 746 . . . . . 6 (𝑦 = 𝐴 → ((𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
5049elabg 3334 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
5130, 40, 50pm5.21nd 940 . . . 4 (𝐽 ∈ Top → (𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
5228, 51bitrd 268 . . 3 (𝐽 ∈ Top → (𝐴 ∈ (LocFin‘𝐽) ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
534, 52biadan2 673 . 2 (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
54 3anass 1040 . 2 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) ↔ (𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
5553, 54bitr4i 267 1 (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1480   ∈ wcel 1987  {cab 2607   ≠ wne 2790  ∀wral 2907  ∃wrex 2908  {crab 2911  Vcvv 3186   ∩ cin 3554   ⊆ wss 3555  ∅c0 3891  𝒫 cpw 4130  ∪ cuni 4402  dom cdm 5074  ‘cfv 5847  Fincfn 7899  Topctop 20617  LocFinclocfin 21217 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-iota 5810  df-fun 5849  df-fv 5855  df-top 20621  df-locfin 21220 This theorem is referenced by:  finlocfin  21233  locfintop  21234  locfinbas  21235  locfinnei  21236  lfinun  21238  dissnlocfin  21242  locfindis  21243  locfincf  21244  locfinreflem  29689  locfinref  29690
 Copyright terms: Public domain W3C validator