Theorem islocfin 23012

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.

Step	Hyp	Ref	Expression
1		df-locfin 23002	. . . 4 ⊢ LocFin = (𝑗 ∈ Top ↦ {𝑦 ∣ (∪ 𝑗 = ∪ 𝑦 ∧ ∀𝑥 ∈ ∪ 𝑗∃𝑛 ∈ 𝑗 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))})
2	1	mptrcl 7004	. . 3 ⊢ (𝐴 ∈ (LocFin‘𝐽) → 𝐽 ∈ Top)
3		eqimss2 4040	. . . . . . . . . . 11 ⊢ (𝑋 = ∪ 𝑦 → ∪ 𝑦 ⊆ 𝑋)
4		sspwuni 5102	. . . . . . . . . . 11 ⊢ (𝑦 ⊆ 𝒫 𝑋 ↔ ∪ 𝑦 ⊆ 𝑋)
5	3, 4	sylibr 233	. . . . . . . . . 10 ⊢ (𝑋 = ∪ 𝑦 → 𝑦 ⊆ 𝒫 𝑋)
6		velpw 4606	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 ↔ 𝑦 ⊆ 𝒫 𝑋)
7	5, 6	sylibr 233	. . . . . . . . 9 ⊢ (𝑋 = ∪ 𝑦 → 𝑦 ∈ 𝒫 𝒫 𝑋)
8	7	adantr 481	. . . . . . . 8 ⊢ ((𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)) → 𝑦 ∈ 𝒫 𝒫 𝑋)
9	8	abssi 4066	. . . . . . 7 ⊢ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ⊆ 𝒫 𝒫 𝑋
10		islocfin.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽
11	10	topopn 22399	. . . . . . . 8 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
12		pwexg 5375	. . . . . . . 8 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
13		pwexg 5375	. . . . . . . 8 ⊢ (𝒫 𝑋 ∈ V → 𝒫 𝒫 𝑋 ∈ V)
14	11, 12, 13	3syl 18	. . . . . . 7 ⊢ (𝐽 ∈ Top → 𝒫 𝒫 𝑋 ∈ V)
15		ssexg 5322	. . . . . . 7 ⊢ (({𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ⊆ 𝒫 𝒫 𝑋 ∧ 𝒫 𝒫 𝑋 ∈ V) → {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ∈ V)
16	9, 14, 15	sylancr 587	. . . . . 6 ⊢ (𝐽 ∈ Top → {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ∈ V)
17		unieq 4918	. . . . . . . . . . 11 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
18	17, 10	eqtr4di 2790	. . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
19	18	eqeq1d 2734	. . . . . . . . 9 ⊢ (𝑗 = 𝐽 → (∪ 𝑗 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑦))
20		rexeq 3321	. . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → (∃𝑛 ∈ 𝑗 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)))
21	18, 20	raleqbidv 3342	. . . . . . . . 9 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ ∪ 𝑗∃𝑛 ∈ 𝑗 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin) ↔ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)))
22	19, 21	anbi12d 631	. . . . . . . 8 ⊢ (𝑗 = 𝐽 → ((∪ 𝑗 = ∪ 𝑦 ∧ ∀𝑥 ∈ ∪ 𝑗∃𝑛 ∈ 𝑗 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)) ↔ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
23	22	abbidv 2801	. . . . . . 7 ⊢ (𝑗 = 𝐽 → {𝑦 ∣ (∪ 𝑗 = ∪ 𝑦 ∧ ∀𝑥 ∈ ∪ 𝑗∃𝑛 ∈ 𝑗 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} = {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))})
24	23, 1	fvmptg 6993	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ∈ V) → (LocFin‘𝐽) = {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))})
25	16, 24	mpdan 685	. . . . 5 ⊢ (𝐽 ∈ Top → (LocFin‘𝐽) = {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))})
26	25	eleq2d 2819	. . . 4 ⊢ (𝐽 ∈ Top → (𝐴 ∈ (LocFin‘𝐽) ↔ 𝐴 ∈ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))}))
27		elex 3492	. . . . . 6 ⊢ (𝐴 ∈ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} → 𝐴 ∈ V)
28	27	adantl 482	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))}) → 𝐴 ∈ V)
29		simpr 485	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
30		islocfin.2	. . . . . . . . . 10 ⊢ 𝑌 = ∪ 𝐴
31	29, 30	eqtrdi 2788	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 = ∪ 𝐴)
32	11	adantr 481	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝑋 ∈ 𝐽)
33	31, 32	eqeltrrd 2834	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → ∪ 𝐴 ∈ 𝐽)
34	33	elexd 3494	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → ∪ 𝐴 ∈ V)
35		uniexb 7747	. . . . . . 7 ⊢ (𝐴 ∈ V ↔ ∪ 𝐴 ∈ V)
36	34, 35	sylibr 233	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌) → 𝐴 ∈ V)
37	36	adantrr 715	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))) → 𝐴 ∈ V)
38		unieq 4918	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → ∪ 𝑦 = ∪ 𝐴)
39	38, 30	eqtr4di 2790	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → ∪ 𝑦 = 𝑌)
40	39	eqeq2d 2743	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = 𝑌))
41		rabeq 3446	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} = {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅})
42	41	eleq1d 2818	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → ({𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin ↔ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))
43	42	anbi2d 629	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → ((𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin) ↔ (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)))
44	43	rexbidv 3178	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)))
45	44	ralbidv 3177	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin) ↔ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)))
46	40, 45	anbi12d 631	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)) ↔ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
47	46	elabg 3665	. . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ↔ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
48	28, 37, 47	pm5.21nd 800	. . . 4 ⊢ (𝐽 ∈ Top → (𝐴 ∈ {𝑦 ∣ (𝑋 = ∪ 𝑦 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝑦 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))} ↔ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
49	26, 48	bitrd 278	. . 3 ⊢ (𝐽 ∈ Top → (𝐴 ∈ (LocFin‘𝐽) ↔ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
50	2, 49	biadanii 820	. 2 ⊢ (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
51		3anass 1095	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)) ↔ (𝐽 ∈ Top ∧ (𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin))))
52	50, 51	bitr4i 277	1 ⊢ (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ {𝑠 ∈ 𝐴 ∣ (𝑠 ∩ 𝑛) ≠ ∅} ∈ Fin)))

Syntax hints:   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  {cab 2709   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  {crab 3432  Vcvv 3474   ∩ cin 3946   ⊆ wss 3947  ∅c0 4321  𝒫 cpw 4601  ∪ cuni 4907  ‘cfv 6540  Fincfn 8935  Topctop 22386  LocFinclocfin 22999

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fv 6548  df-top 22387  df-locfin 23002

This theorem is referenced by:  finlocfin  23015  locfintop  23016  locfinbas  23017  locfinnei  23018  lfinun  23020  dissnlocfin  23024  locfindis  23025  locfincf  23026  locfinreflem  32808  locfinref  32809