Theorem fnemeet1 36897

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 23124	. . . . . . . 8 ⊢ (𝑡 ∈ 𝑆 → ∪ (topGen‘𝑡) = ∪ 𝑡)
2	1	adantl 486	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ (topGen‘𝑡) = ∪ 𝑡)
3		unieq 4883	. . . . . . . . . 10 ⊢ (𝑦 = 𝑡 → ∪ 𝑦 = ∪ 𝑡)
4	3	eqeq2d 2774	. . . . . . . . 9 ⊢ (𝑦 = 𝑡 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑡))
5	4	rspccva 3580	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑡 ∈ 𝑆) → 𝑋 = ∪ 𝑡)
6	5	3ad2antl2 1205	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → 𝑋 = ∪ 𝑡)
7	2, 6	eqtr4d 2801	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ (topGen‘𝑡) = 𝑋)
8		eqimss 3995	. . . . . 6 ⊢ (∪ (topGen‘𝑡) = 𝑋 → ∪ (topGen‘𝑡) ⊆ 𝑋)
9	7, 8	syl 18	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ (topGen‘𝑡) ⊆ 𝑋)
10		sspwuni 5066	. . . . 5 ⊢ ((topGen‘𝑡) ⊆ 𝒫 𝑋 ↔ ∪ (topGen‘𝑡) ⊆ 𝑋)
11	9, 10	sylibr 237	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → (topGen‘𝑡) ⊆ 𝒫 𝑋)
12	11	ralrimiva 3157	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∀𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ 𝒫 𝑋)
13		ne0i 4294	. . . 4 ⊢ (𝐴 ∈ 𝑆 → 𝑆 ≠ ∅)
14	13	3ad2ant3 1153	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝑆 ≠ ∅)
15		riinn0 5049	. . 3 ⊢ ((∀𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ 𝒫 𝑋 ∧ 𝑆 ≠ ∅) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
16	12, 14, 15	syl2anc 595	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
17		simp3 1156	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝐴 ∈ 𝑆)
18		ssid 3959	. . . . . . . 8 ⊢ (topGen‘𝐴) ⊆ (topGen‘𝐴)
19		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑡 = 𝐴 → (topGen‘𝑡) = (topGen‘𝐴))
20	19	sseq1d 3968	. . . . . . . . 9 ⊢ (𝑡 = 𝐴 → ((topGen‘𝑡) ⊆ (topGen‘𝐴) ↔ (topGen‘𝐴) ⊆ (topGen‘𝐴)))
21	20	rspcev 3581	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑆 ∧ (topGen‘𝐴) ⊆ (topGen‘𝐴)) → ∃𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
22	17, 18, 21	sylancl 597	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∃𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
23		iinss 5021	. . . . . . 7 ⊢ (∃𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴) → ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
24	22, 23	syl 18	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴))
25	24	unissd 4882	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ ∪ (topGen‘𝐴))
26		unitg 23124	. . . . . 6 ⊢ (𝐴 ∈ 𝑆 → ∪ (topGen‘𝐴) = ∪ 𝐴)
27	26	3ad2ant3 1153	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ (topGen‘𝐴) = ∪ 𝐴)
28	25, 27	sseqtrd 3973	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ ∪ 𝐴)
29		unieq 4883	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐴 → ∪ 𝑦 = ∪ 𝐴)
30	29	eqeq2d 2774	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝐴))
31	30	rspccva 3580	. . . . . . . . . . 11 ⊢ ((∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝑋 = ∪ 𝐴)
32	31	3adant1 1148	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → 𝑋 = ∪ 𝐴)
33	32	adantr 485	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → 𝑋 = ∪ 𝐴)
34	33, 6	eqtr3d 2800	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ 𝐴 = ∪ 𝑡)
35		simpr 489	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → 𝑡 ∈ 𝑆)
36		ssid 3959	. . . . . . . . 9 ⊢ 𝑡 ⊆ 𝑡
37		eltg3i 23118	. . . . . . . . 9 ⊢ ((𝑡 ∈ 𝑆 ∧ 𝑡 ⊆ 𝑡) → ∪ 𝑡 ∈ (topGen‘𝑡))
38	35, 36, 37	sylancl 597	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ 𝑡 ∈ (topGen‘𝑡))
39	34, 38	eqeltrd 2863	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) ∧ 𝑡 ∈ 𝑆) → ∪ 𝐴 ∈ (topGen‘𝑡))
40	39	ralrimiva 3157	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∀𝑡 ∈ 𝑆 ∪ 𝐴 ∈ (topGen‘𝑡))
41		uniexg 7738	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑆 → ∪ 𝐴 ∈ V)
42	41	3ad2ant3 1153	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ 𝐴 ∈ V)
43		eliin 4961	. . . . . . 7 ⊢ (∪ 𝐴 ∈ V → (∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ↔ ∀𝑡 ∈ 𝑆 ∪ 𝐴 ∈ (topGen‘𝑡)))
44	42, 43	syl 18	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ↔ ∀𝑡 ∈ 𝑆 ∪ 𝐴 ∈ (topGen‘𝑡)))
45	40, 44	mpbird 260	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
46		elssuni 4904	. . . . 5 ⊢ (∪ 𝐴 ∈ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) → ∪ 𝐴 ⊆ ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
47	45, 46	syl 18	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ 𝐴 ⊆ ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
48	28, 47	eqssd 3954	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) = ∪ 𝐴)
49		eqid 2763	. . . 4 ⊢ ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) = ∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)
50		eqid 2763	. . . 4 ⊢ ∪ 𝐴 = ∪ 𝐴
51	49, 50	isfne4 36871	. . 3 ⊢ (∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)Fne𝐴 ↔ (∪ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) = ∪ 𝐴 ∧ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ⊆ (topGen‘𝐴)))
52	48, 24, 51	sylanbrc 594	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)Fne𝐴)
53	16, 52	eqbrtrd 5133	1 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝐴 ∈ 𝑆) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝐴)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  ∃wrex 3089  Vcvv 3455   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286  𝒫 cpw 4562  ∪ cuni 4872  ∩ ciin 4957   class class class wbr 5109  ‘cfv 6536  topGenctg 17485  Fnecfne 36867

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-topgen 17491  df-fne 36868

This theorem is referenced by:  fnemeet2  36898