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

Theorem islocfin 23473
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 23463 . . . 4 LocFin = (𝑗 ∈ Top ↦ {𝑦 ∣ ( 𝑗 = 𝑦 ∧ ∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
21mptrcl 6959 . . 3 (𝐴 ∈ (LocFin‘𝐽) → 𝐽 ∈ Top)
3 eqimss2 3995 . . . . . . . . . . 11 (𝑋 = 𝑦 𝑦𝑋)
4 sspwuni 5057 . . . . . . . . . . 11 (𝑦 ⊆ 𝒫 𝑋 𝑦𝑋)
53, 4sylibr 234 . . . . . . . . . 10 (𝑋 = 𝑦𝑦 ⊆ 𝒫 𝑋)
6 velpw 4561 . . . . . . . . . 10 (𝑦 ∈ 𝒫 𝒫 𝑋𝑦 ⊆ 𝒫 𝑋)
75, 6sylibr 234 . . . . . . . . 9 (𝑋 = 𝑦𝑦 ∈ 𝒫 𝒫 𝑋)
87adantr 480 . . . . . . . 8 ((𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) → 𝑦 ∈ 𝒫 𝒫 𝑋)
98abssi 4022 . . . . . . 7 {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ⊆ 𝒫 𝒫 𝑋
10 islocfin.1 . . . . . . . . 9 𝑋 = 𝐽
1110topopn 22862 . . . . . . . 8 (𝐽 ∈ Top → 𝑋𝐽)
12 pwexg 5325 . . . . . . . 8 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
13 pwexg 5325 . . . . . . . 8 (𝒫 𝑋 ∈ V → 𝒫 𝒫 𝑋 ∈ V)
1411, 12, 133syl 18 . . . . . . 7 (𝐽 ∈ Top → 𝒫 𝒫 𝑋 ∈ V)
15 ssexg 5270 . . . . . . 7 (({𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ⊆ 𝒫 𝒫 𝑋 ∧ 𝒫 𝒫 𝑋 ∈ V) → {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ∈ V)
169, 14, 15sylancr 588 . . . . . 6 (𝐽 ∈ Top → {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ∈ V)
17 unieq 4876 . . . . . . . . . . 11 (𝑗 = 𝐽 𝑗 = 𝐽)
1817, 10eqtr4di 2790 . . . . . . . . . 10 (𝑗 = 𝐽 𝑗 = 𝑋)
1918eqeq1d 2739 . . . . . . . . 9 (𝑗 = 𝐽 → ( 𝑗 = 𝑦𝑋 = 𝑦))
20 rexeq 3294 . . . . . . . . . 10 (𝑗 = 𝐽 → (∃𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
2118, 20raleqbidv 3318 . . . . . . . . 9 (𝑗 = 𝐽 → (∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
2219, 21anbi12d 633 . . . . . . . 8 (𝑗 = 𝐽 → (( 𝑗 = 𝑦 ∧ ∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) ↔ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
2322abbidv 2803 . . . . . . 7 (𝑗 = 𝐽 → {𝑦 ∣ ( 𝑗 = 𝑦 ∧ ∀𝑥 𝑗𝑛𝑗 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} = {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
2423, 1fvmptg 6947 . . . . . 6 ((𝐽 ∈ Top ∧ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ∈ V) → (LocFin‘𝐽) = {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
2516, 24mpdan 688 . . . . 5 (𝐽 ∈ Top → (LocFin‘𝐽) = {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))})
2625eleq2d 2823 . . . 4 (𝐽 ∈ Top → (𝐴 ∈ (LocFin‘𝐽) ↔ 𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))}))
27 elex 3463 . . . . . 6 (𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} → 𝐴 ∈ V)
2827adantl 481 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))}) → 𝐴 ∈ V)
29 simpr 484 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
30 islocfin.2 . . . . . . . . . 10 𝑌 = 𝐴
3129, 30eqtrdi 2788 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 = 𝐴)
3211adantr 480 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋𝐽)
3331, 32eqeltrrd 2838 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴𝐽)
3433elexd 3466 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴 ∈ V)
35 uniexb 7719 . . . . . . 7 (𝐴 ∈ V ↔ 𝐴 ∈ V)
3634, 35sylibr 234 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴 ∈ V)
3736adantrr 718 . . . . 5 ((𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))) → 𝐴 ∈ V)
38 unieq 4876 . . . . . . . . 9 (𝑦 = 𝐴 𝑦 = 𝐴)
3938, 30eqtr4di 2790 . . . . . . . 8 (𝑦 = 𝐴 𝑦 = 𝑌)
4039eqeq2d 2748 . . . . . . 7 (𝑦 = 𝐴 → (𝑋 = 𝑦𝑋 = 𝑌))
41 rabeq 3415 . . . . . . . . . . 11 (𝑦 = 𝐴 → {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} = {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅})
4241eleq1d 2822 . . . . . . . . . 10 (𝑦 = 𝐴 → ({𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin ↔ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
4342anbi2d 631 . . . . . . . . 9 (𝑦 = 𝐴 → ((𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
4443rexbidv 3162 . . . . . . . 8 (𝑦 = 𝐴 → (∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
4544ralbidv 3161 . . . . . . 7 (𝑦 = 𝐴 → (∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
4640, 45anbi12d 633 . . . . . 6 (𝑦 = 𝐴 → ((𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
4746elabg 3633 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
4828, 37, 47pm5.21nd 802 . . . 4 (𝐽 ∈ Top → (𝐴 ∈ {𝑦 ∣ (𝑋 = 𝑦 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝑦 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))} ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
4926, 48bitrd 279 . . 3 (𝐽 ∈ Top → (𝐴 ∈ (LocFin‘𝐽) ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
502, 49biadanii 822 . 2 (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
51 3anass 1095 . 2 ((𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)) ↔ (𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))))
5250, 51bitr4i 278 1 (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  {cab 2715  wne 2933  wral 3052  wrex 3062  {crab 3401  Vcvv 3442  cin 3902  wss 3903  c0 4287  𝒫 cpw 4556   cuni 4865  cfv 6500  Fincfn 8895  Topctop 22849  LocFinclocfin 23460
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fv 6508  df-top 22850  df-locfin 23463
This theorem is referenced by:  finlocfin  23476  locfintop  23477  locfinbas  23478  locfinnei  23479  lfinun  23481  dissnlocfin  23485  locfindis  23486  locfincf  23487  locfinreflem  34018  locfinref  34019
  Copyright terms: Public domain W3C validator