Theorem fnemeet2 36328

Description: The meet of equivalence classes under the fineness relation-part two. (Contributed by Jeff Hankins, 6-Oct-2009.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)

Assertion

Ref	Expression
fnemeet2	⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ↔ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)))

Distinct variable groups:   𝑦,𝑡,𝑥,𝑆   𝑡,𝑉,𝑥   𝑡,𝑋,𝑥,𝑦   𝑡,𝑇,𝑥

Allowed substitution hints:   𝑇(𝑦)   𝑉(𝑦)

Proof of Theorem fnemeet2

Step	Hyp	Ref	Expression
1		riin0 5041	. . . . . . . . . 10 ⊢ (𝑆 = ∅ → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = 𝒫 𝑋)
2	1	unieqd 4880	. . . . . . . . 9 ⊢ (𝑆 = ∅ → ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∪ 𝒫 𝑋)
3		unipw 5405	. . . . . . . . 9 ⊢ ∪ 𝒫 𝑋 = 𝑋
4	2, 3	eqtr2di 2781	. . . . . . . 8 ⊢ (𝑆 = ∅ → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
5	4	a1i 11	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑆 = ∅ → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
6		n0 4312	. . . . . . . 8 ⊢ (𝑆 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑆)
7		unieq 4878	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → ∪ 𝑦 = ∪ 𝑥)
8	7	eqeq2d 2740	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑥))
9	8	rspccva 3584	. . . . . . . . . . . 12 ⊢ ((∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑥 ∈ 𝑆) → 𝑋 = ∪ 𝑥)
10	9	3adant1 1130	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑥 ∈ 𝑆) → 𝑋 = ∪ 𝑥)
11		fnemeet1 36327	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑥 ∈ 𝑆) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝑥)
12		eqid 2729	. . . . . . . . . . . . 13 ⊢ ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
13		eqid 2729	. . . . . . . . . . . . 13 ⊢ ∪ 𝑥 = ∪ 𝑥
14	12, 13	fnebas 36305	. . . . . . . . . . . 12 ⊢ ((𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝑥 → ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∪ 𝑥)
15	11, 14	syl 17	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑥 ∈ 𝑆) → ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) = ∪ 𝑥)
16	10, 15	eqtr4d 2767	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑥 ∈ 𝑆) → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
17	16	3expia 1121	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑥 ∈ 𝑆 → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
18	17	exlimdv 1933	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (∃𝑥 𝑥 ∈ 𝑆 → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
19	6, 18	biimtrid 242	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑆 ≠ ∅ → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
20	5, 19	pm2.61dne 3011	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
21	20	adantr 480	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ 𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))) → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
22		eqid 2729	. . . . . . 7 ⊢ ∪ 𝑇 = ∪ 𝑇
23	22, 12	fnebas 36305	. . . . . 6 ⊢ (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → ∪ 𝑇 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
24	23	adantl 481	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ 𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))) → ∪ 𝑇 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
25	21, 24	eqtr4d 2767	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ 𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))) → 𝑋 = ∪ 𝑇)
26	25	ex 412	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → 𝑋 = ∪ 𝑇))
27		fnetr 36312	. . . . . . 7 ⊢ ((𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ∧ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝑥) → 𝑇Fne𝑥)
28	27	expcom 413	. . . . . 6 ⊢ ((𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))Fne𝑥 → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → 𝑇Fne𝑥))
29	11, 28	syl 17	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦 ∧ 𝑥 ∈ 𝑆) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → 𝑇Fne𝑥))
30	29	3expa 1118	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ 𝑥 ∈ 𝑆) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → 𝑇Fne𝑥))
31	30	ralrimdva 3133	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → ∀𝑥 ∈ 𝑆 𝑇Fne𝑥))
32	26, 31	jcad 512	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) → (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)))
33		simprl 770	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑋 = ∪ 𝑇)
34	20	adantr 480	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑋 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
35	33, 34	eqtr3d 2766	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → ∪ 𝑇 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
36		eqimss2 4003	. . . . . . . 8 ⊢ (𝑋 = ∪ 𝑇 → ∪ 𝑇 ⊆ 𝑋)
37	36	ad2antrl 728	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → ∪ 𝑇 ⊆ 𝑋)
38		sspwuni 5059	. . . . . . 7 ⊢ (𝑇 ⊆ 𝒫 𝑋 ↔ ∪ 𝑇 ⊆ 𝑋)
39	37, 38	sylibr 234	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑇 ⊆ 𝒫 𝑋)
40		breq2 5106	. . . . . . . . . 10 ⊢ (𝑥 = 𝑡 → (𝑇Fne𝑥 ↔ 𝑇Fne𝑡))
41	40	cbvralvw 3213	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝑆 𝑇Fne𝑥 ↔ ∀𝑡 ∈ 𝑆 𝑇Fne𝑡)
42		fnetg 36306	. . . . . . . . . 10 ⊢ (𝑇Fne𝑡 → 𝑇 ⊆ (topGen‘𝑡))
43	42	ralimi 3066	. . . . . . . . 9 ⊢ (∀𝑡 ∈ 𝑆 𝑇Fne𝑡 → ∀𝑡 ∈ 𝑆 𝑇 ⊆ (topGen‘𝑡))
44	41, 43	sylbi 217	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑆 𝑇Fne𝑥 → ∀𝑡 ∈ 𝑆 𝑇 ⊆ (topGen‘𝑡))
45	44	ad2antll 729	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → ∀𝑡 ∈ 𝑆 𝑇 ⊆ (topGen‘𝑡))
46		ssiin 5014	. . . . . . 7 ⊢ (𝑇 ⊆ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡) ↔ ∀𝑡 ∈ 𝑆 𝑇 ⊆ (topGen‘𝑡))
47	45, 46	sylibr 234	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑇 ⊆ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))
48	39, 47	ssind 4200	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑇 ⊆ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
49		pwexg 5328	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ V)
50		inex1g 5269	. . . . . . . 8 ⊢ (𝒫 𝑋 ∈ V → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ∈ V)
51	49, 50	syl 17	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ∈ V)
52	51	ad2antrr 726	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ∈ V)
53		bastg 22829	. . . . . 6 ⊢ ((𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ∈ V → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ⊆ (topGen‘(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
54	52, 53	syl 17	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ⊆ (topGen‘(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
55	48, 54	sstrd 3954	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑇 ⊆ (topGen‘(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
56	22, 12	isfne4 36301	. . . 4 ⊢ (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ↔ (∪ 𝑇 = ∪ (𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ∧ 𝑇 ⊆ (topGen‘(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))))
57	35, 55, 56	sylanbrc 583	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) ∧ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)) → 𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)))
58	57	ex 412	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → ((𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥) → 𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡))))
59	32, 58	impbid 212	1 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝑆 𝑋 = ∪ 𝑦) → (𝑇Fne(𝒫 𝑋 ∩ ∩ 𝑡 ∈ 𝑆 (topGen‘𝑡)) ↔ (𝑋 = ∪ 𝑇 ∧ ∀𝑥 ∈ 𝑆 𝑇Fne𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  Vcvv 3444   ∩ cin 3910   ⊆ wss 3911  ∅c0 4292  𝒫 cpw 4559  ∪ cuni 4867  ∩ ciin 4952   class class class wbr 5102  ‘cfv 6499  topGenctg 17376  Fnecfne 36297

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6452  df-fun 6501  df-fv 6507  df-topgen 17382  df-fne 36298

This theorem is referenced by: (None)