Theorem fnemeet1 33718

Description: The meet of a collection of equivalence classes of covers with respect to fineness. (Contributed by Jeff Hankins, 5-Oct-2009.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)

Assertion

Ref	Expression
fnemeet1	⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝐴)

Distinct variable groups:   𝑦,𝑡,𝐴   𝑡,𝑆,𝑦   𝑡,𝑉   𝑡,𝑋,𝑦

Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem fnemeet1

Step	Hyp	Ref	Expression
1		unitg 21578	. . . . . . . 8 ⊢ (𝑡 ∈ 𝑆 → ∪ (topGen‘𝑡) = ∪ 𝑡)
2	1	adantl 484	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ (topGen‘𝑡) = ∪ 𝑡)
3		unieq 4852	. . . . . . . . . 10 ⊢ (𝑦 = 𝑡 → ∪ 𝑦 = ∪ 𝑡)
4	3	eqeq2d 2835	. . . . . . . . 9 ⊢ (𝑦 = 𝑡 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑡))
5	4	rspccva 3625	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑡 ∈ 𝑆) → 𝑋 = ∪ 𝑡)
6	5	3ad2antl2 1182	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → 𝑋 = ∪ 𝑡)
7	2, 6	eqtr4d 2862	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ (topGen‘𝑡) = 𝑋)
8		eqimss 4026	. . . . . 6 ⊢ (∪ (topGen‘𝑡) = 𝑋 → ∪ (topGen‘𝑡) ⊆ 𝑋)
9	7, 8	syl 17	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ (topGen‘𝑡) ⊆ 𝑋)
10		sspwuni 5025	. . . . 5 ⊢ ((topGen‘𝑡) ⊆ 𝒫 𝑋 ↔ ∪ (topGen‘𝑡) ⊆ 𝑋)
11	9, 10	sylibr 236	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → (topGen‘𝑡) ⊆ 𝒫 𝑋)
12	11	ralrimiva 3185	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∀𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ 𝒫 𝑋)
13		ne0i 4303	. . . 4 ⊢ (𝐴 ∈ 𝑆 → 𝑆 ≠ ∅)
14	13	3ad2ant3 1131	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝑆 ≠ ∅)
15		riinn0 5008	. . 3 ⊢ ((∀𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ 𝒫 𝑋 ∧ 𝑆 ≠ ∅) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
16	12, 14, 15	syl2anc 586	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
17		simp3 1134	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝐴 ∈ 𝑆)
18		ssid 3992	. . . . . . . 8 ⊢ (topGen‘𝐴) ⊆ (topGen‘𝐴)
19		fveq2 6673	. . . . . . . . . 10 ⊢ (𝑡 = 𝐴 → (topGen‘𝑡) = (topGen‘𝐴))
20	19	sseq1d 4001	. . . . . . . . 9 ⊢ (𝑡 = 𝐴 → ((topGen‘𝑡) ⊆ (topGen‘𝐴) ↔ (topGen‘𝐴) ⊆ (topGen‘𝐴)))
21	20	rspcev 3626	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑆 ∧ (topGen‘𝐴) ⊆ (topGen‘𝐴)) → ∃𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
22	17, 18, 21	sylancl 588	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∃𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
23		iinss 4983	. . . . . . 7 ⊢ (∃𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴) → ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
24	22, 23	syl 17	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
25	24	unissd 4851	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ ∪ (topGen‘𝐴))
26		unitg 21578	. . . . . 6 ⊢ (𝐴 ∈ 𝑆 → ∪ (topGen‘𝐴) = ∪ 𝐴)
27	26	3ad2ant3 1131	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ (topGen‘𝐴) = ∪ 𝐴)
28	25, 27	sseqtrd 4010	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ ∪ 𝐴)
29		unieq 4852	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐴 → ∪ 𝑦 = ∪ 𝐴)
30	29	eqeq2d 2835	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝐴))
31	30	rspccva 3625	. . . . . . . . . . 11 ⊢ ((∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝑋 = ∪ 𝐴)
32	31	3adant1 1126	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝑋 = ∪ 𝐴)
33	32	adantr 483	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → 𝑋 = ∪ 𝐴)
34	33, 6	eqtr3d 2861	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ 𝐴 = ∪ 𝑡)
35		simpr 487	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → 𝑡 ∈ 𝑆)
36		ssid 3992	. . . . . . . . 9 ⊢ 𝑡 ⊆ 𝑡
37		eltg3i 21572	. . . . . . . . 9 ⊢ ((𝑡 ∈ 𝑆 ∧ 𝑡 ⊆ 𝑡) → ∪ 𝑡 ∈ (topGen‘𝑡))
38	35, 36, 37	sylancl 588	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ 𝑡 ∈ (topGen‘𝑡))
39	34, 38	eqeltrd 2916	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ 𝐴 ∈ (topGen‘𝑡))
40	39	ralrimiva 3185	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∀𝑡 ∈ 𝑆 ∪ 𝐴 ∈ (topGen‘𝑡))
41		uniexg 7469	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑆 → ∪ 𝐴 ∈ V)
42	41	3ad2ant3 1131	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ 𝐴 ∈ V)
43		eliin 4927	. . . . . . 7 ⊢ (∪ 𝐴 ∈ V → (∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ↔ ∀𝑡 ∈ 𝑆 ∪ 𝐴 ∈ (topGen‘𝑡)))
44	42, 43	syl 17	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ↔ ∀𝑡 ∈ 𝑆 ∪ 𝐴 ∈ (topGen‘𝑡)))
45	40, 44	mpbird 259	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
46		elssuni 4871	. . . . 5 ⊢ (∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) → ∪ 𝐴 ⊆ ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
47	45, 46	syl 17	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ 𝐴 ⊆ ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
48	28, 47	eqssd 3987	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) = ∪ 𝐴)
49		eqid 2824	. . . 4 ⊢ ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) = ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)
50		eqid 2824	. . . 4 ⊢ ∪ 𝐴 = ∪ 𝐴
51	49, 50	isfne4 33692	. . 3 ⊢ (∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)Fne𝐴 ↔ (∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) = ∪ 𝐴 ∧ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴)))
52	48, 24, 51	sylanbrc 585	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)Fne𝐴)
53	16, 52	eqbrtrd 5091	1 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝐴)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1536   ∈ wcel 2113   ≠ wne 3019  ∀wral 3141  ∃wrex 3142  Vcvv 3497   ∩ cin 3938   ⊆ wss 3939  ∅c0 4294  𝒫 cpw 4542  ∪ cuni 4841  ∩ ciin 4923   class class class wbr 5069  ‘cfv 6358  topGenctg 16714  Fnecfne 33688

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iin 4925  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-iota 6317  df-fun 6360  df-fv 6366  df-topgen 16720  df-fne 33689

This theorem is referenced by:  fnemeet2  33719