Theorem tgrest 23457

Description: A subspace can be generated by restricted sets from a basis for the original topology. (Contributed by Mario Carneiro, 19-Mar-2015.) (Proof shortened by Mario Carneiro, 30-Aug-2015.)

Assertion

Ref	Expression
tgrest	⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (topGen‘(𝐵 ↾t 𝐴)) = ((topGen‘𝐵) ↾t 𝐴))

Proof of Theorem tgrest

Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovex 7445	. . . . 5 ⊢ (𝐵 ↾t 𝐴) ∈ V
2		eltg3 23260	. . . . 5 ⊢ ((𝐵 ↾t 𝐴) ∈ V → (𝑥 ∈ (topGen‘(𝐵 ↾t 𝐴)) ↔ ∃𝑦(𝑦 ⊆ (𝐵 ↾t 𝐴) ∧ 𝑥 = ∪ 𝑦)))
3	1, 2	ax-mp 5	. . . 4 ⊢ (𝑥 ∈ (topGen‘(𝐵 ↾t 𝐴)) ↔ ∃𝑦(𝑦 ⊆ (𝐵 ↾t 𝐴) ∧ 𝑥 = ∪ 𝑦))
4		simpll 779	. . . . . . . . 9 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → 𝐵 ∈ 𝑉)
5		funmpt 6570	. . . . . . . . . 10 ⊢ Fun (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴))
6	5	a1i 11	. . . . . . . . 9 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → Fun (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)))
7		restval 17577	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝐵 ↾t 𝐴) = ran (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)))
8	7	sseq2d 3963	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑦 ⊆ (𝐵 ↾t 𝐴) ↔ 𝑦 ⊆ ran (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴))))
9	8	biimpa 482	. . . . . . . . . 10 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → 𝑦 ⊆ ran (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)))
10		vex 3455	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
11	10	inex1 5277	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝐴) ∈ V
12	11	rgenw 3081	. . . . . . . . . . 11 ⊢ ∀𝑥 ∈ 𝐵 (𝑥 ∩ 𝐴) ∈ V
13		eqid 2761	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴))
14	13	fnmpt 6671	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 ∩ 𝐴) ∈ V → (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) Fn 𝐵)
15		fnima 6661	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) Fn 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝐵) = ran (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)))
16	12, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝐵) = ran (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴))
17	9, 16	sseqtrrdi 3972	. . . . . . . . 9 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → 𝑦 ⊆ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝐵))
18		ssimaexg 6963	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ Fun (𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) ∧ 𝑦 ⊆ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝐵)) → ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧)))
19	4, 6, 17, 18	syl3anc 1398	. . . . . . . 8 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧)))
20		df-ima 5664	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) = ran ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) ↾ 𝑧)
21		resmpt 6031	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 ⊆ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) ↾ 𝑧) = (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)))
22	21	adantl 487	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) ↾ 𝑧) = (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)))
23	22	rneqd 5920	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ran ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) ↾ 𝑧) = ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)))
24	20, 23	eqtrid 2808	. . . . . . . . . . . . . . . 16 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) = ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)))
25	24	unieqd 4880	. . . . . . . . . . . . . . 15 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) = ∪ ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)))
26	11	dfiun3 5952	. . . . . . . . . . . . . . 15 ⊢ ∪ 𝑥 ∈ 𝑧 (𝑥 ∩ 𝐴) = ∪ ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴))
27	25, 26	eqtr4di 2814	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) = ∪ 𝑥 ∈ 𝑧 (𝑥 ∩ 𝐴))
28		iunin1 5030	. . . . . . . . . . . . . 14 ⊢ ∪ 𝑥 ∈ 𝑧 (𝑥 ∩ 𝐴) = (∪ 𝑥 ∈ 𝑧 𝑥 ∩ 𝐴)
29	27, 28	eqtrdi 2812	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) = (∪ 𝑥 ∈ 𝑧 𝑥 ∩ 𝐴))
30		fvex 6890	. . . . . . . . . . . . . 14 ⊢ (topGen‘𝐵) ∈ V
31		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → 𝐴 ∈ 𝑊)
32		uniiun 5017	. . . . . . . . . . . . . . . 16 ⊢ ∪ 𝑧 = ∪ 𝑥 ∈ 𝑧 𝑥
33		eltg3i 23259	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑧 ⊆ 𝐵) → ∪ 𝑧 ∈ (topGen‘𝐵))
34	32, 33	eqeltrrid 2866	. . . . . . . . . . . . . . 15 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑧 ⊆ 𝐵) → ∪ 𝑥 ∈ 𝑧 𝑥 ∈ (topGen‘𝐵))
35	34	adantlr 728	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ 𝑥 ∈ 𝑧 𝑥 ∈ (topGen‘𝐵))
36		elrestr 17579	. . . . . . . . . . . . . 14 ⊢ (((topGen‘𝐵) ∈ V ∧ 𝐴 ∈ 𝑊 ∧ ∪ 𝑥 ∈ 𝑧 𝑥 ∈ (topGen‘𝐵)) → (∪ 𝑥 ∈ 𝑧 𝑥 ∩ 𝐴) ∈ ((topGen‘𝐵) ↾t 𝐴))
37	30, 31, 35, 36	mp3an2ani 1497	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → (∪ 𝑥 ∈ 𝑧 𝑥 ∩ 𝐴) ∈ ((topGen‘𝐵) ↾t 𝐴))
38	29, 37	eqeltrd 2861	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) ∈ ((topGen‘𝐵) ↾t 𝐴))
39		unieq 4878	. . . . . . . . . . . . 13 ⊢ (𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) → ∪ 𝑦 = ∪ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧))
40	39	eleq1d 2846	. . . . . . . . . . . 12 ⊢ (𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) → (∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴) ↔ ∪ ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) ∈ ((topGen‘𝐵) ↾t 𝐴)))
41	38, 40	syl5ibrcom 250	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → (𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧) → ∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴)))
42	41	expimpd 459	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((𝑧 ⊆ 𝐵 ∧ 𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧)) → ∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴)))
43	42	exlimdv 1966	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧)) → ∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴)))
44	43	adantr 486	. . . . . . . 8 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → (∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑦 = ((𝑥 ∈ 𝐵 ↦ (𝑥 ∩ 𝐴)) “ 𝑧)) → ∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴)))
45	19, 44	mpd 16	. . . . . . 7 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → ∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴))
46		eleq1 2849	. . . . . . 7 ⊢ (𝑥 = ∪ 𝑦 → (𝑥 ∈ ((topGen‘𝐵) ↾t 𝐴) ↔ ∪ 𝑦 ∈ ((topGen‘𝐵) ↾t 𝐴)))
47	45, 46	syl5ibrcom 250	. . . . . 6 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑦 ⊆ (𝐵 ↾t 𝐴)) → (𝑥 = ∪ 𝑦 → 𝑥 ∈ ((topGen‘𝐵) ↾t 𝐴)))
48	47	expimpd 459	. . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((𝑦 ⊆ (𝐵 ↾t 𝐴) ∧ 𝑥 = ∪ 𝑦) → 𝑥 ∈ ((topGen‘𝐵) ↾t 𝐴)))
49	48	exlimdv 1966	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑦 ⊆ (𝐵 ↾t 𝐴) ∧ 𝑥 = ∪ 𝑦) → 𝑥 ∈ ((topGen‘𝐵) ↾t 𝐴)))
50	3, 49	biimtrid 245	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (topGen‘(𝐵 ↾t 𝐴)) → 𝑥 ∈ ((topGen‘𝐵) ↾t 𝐴)))
51	50	ssrdv 3937	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (topGen‘(𝐵 ↾t 𝐴)) ⊆ ((topGen‘𝐵) ↾t 𝐴))
52		restval 17577	. . . 4 ⊢ (((topGen‘𝐵) ∈ V ∧ 𝐴 ∈ 𝑊) → ((topGen‘𝐵) ↾t 𝐴) = ran (𝑤 ∈ (topGen‘𝐵) ↦ (𝑤 ∩ 𝐴)))
53	30, 31, 52	sylancr 599	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((topGen‘𝐵) ↾t 𝐴) = ran (𝑤 ∈ (topGen‘𝐵) ↦ (𝑤 ∩ 𝐴)))
54		eltg3 23260	. . . . . . . 8 ⊢ (𝐵 ∈ 𝑉 → (𝑤 ∈ (topGen‘𝐵) ↔ ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑤 = ∪ 𝑧)))
55	54	adantr 486	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑤 ∈ (topGen‘𝐵) ↔ ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑤 = ∪ 𝑧)))
56	32	ineq1i 4162	. . . . . . . . . . . 12 ⊢ (∪ 𝑧 ∩ 𝐴) = (∪ 𝑥 ∈ 𝑧 𝑥 ∩ 𝐴)
57	56, 28	eqtr4i 2787	. . . . . . . . . . 11 ⊢ (∪ 𝑧 ∩ 𝐴) = ∪ 𝑥 ∈ 𝑧 (𝑥 ∩ 𝐴)
58		simplll 787	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑧) → 𝐵 ∈ 𝑉)
59		simpllr 788	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑧) → 𝐴 ∈ 𝑊)
60		simpr 490	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → 𝑧 ⊆ 𝐵)
61	60	sselda 3931	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑧) → 𝑥 ∈ 𝐵)
62		elrestr 17579	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∩ 𝐴) ∈ (𝐵 ↾t 𝐴))
63	58, 59, 61, 62	syl3anc 1398	. . . . . . . . . . . . . . 15 ⊢ ((((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑧) → (𝑥 ∩ 𝐴) ∈ (𝐵 ↾t 𝐴))
64	63	fmpttd 7107	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)):𝑧⟶(𝐵 ↾t 𝐴))
65	64	frnd 6710	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)) ⊆ (𝐵 ↾t 𝐴))
66		eltg3i 23259	. . . . . . . . . . . . 13 ⊢ (((𝐵 ↾t 𝐴) ∈ V ∧ ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)) ⊆ (𝐵 ↾t 𝐴)) → ∪ ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)) ∈ (topGen‘(𝐵 ↾t 𝐴)))
67	1, 65, 66	sylancr 599	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ ran (𝑥 ∈ 𝑧 ↦ (𝑥 ∩ 𝐴)) ∈ (topGen‘(𝐵 ↾t 𝐴)))
68	26, 67	eqeltrid 2865	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → ∪ 𝑥 ∈ 𝑧 (𝑥 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴)))
69	57, 68	eqeltrid 2865	. . . . . . . . . 10 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → (∪ 𝑧 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴)))
70		ineq1 4159	. . . . . . . . . . 11 ⊢ (𝑤 = ∪ 𝑧 → (𝑤 ∩ 𝐴) = (∪ 𝑧 ∩ 𝐴))
71	70	eleq1d 2846	. . . . . . . . . 10 ⊢ (𝑤 = ∪ 𝑧 → ((𝑤 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴)) ↔ (∪ 𝑧 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴))))
72	69, 71	syl5ibrcom 250	. . . . . . . . 9 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑧 ⊆ 𝐵) → (𝑤 = ∪ 𝑧 → (𝑤 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴))))
73	72	expimpd 459	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 = ∪ 𝑧) → (𝑤 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴))))
74	73	exlimdv 1966	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑤 = ∪ 𝑧) → (𝑤 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴))))
75	55, 74	sylbid 243	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑤 ∈ (topGen‘𝐵) → (𝑤 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴))))
76	75	imp 412	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) ∧ 𝑤 ∈ (topGen‘𝐵)) → (𝑤 ∩ 𝐴) ∈ (topGen‘(𝐵 ↾t 𝐴)))
77	76	fmpttd 7107	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑤 ∈ (topGen‘𝐵) ↦ (𝑤 ∩ 𝐴)):(topGen‘𝐵)⟶(topGen‘(𝐵 ↾t 𝐴)))
78	77	frnd 6710	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ran (𝑤 ∈ (topGen‘𝐵) ↦ (𝑤 ∩ 𝐴)) ⊆ (topGen‘(𝐵 ↾t 𝐴)))
79	53, 78	eqsstrd 3965	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((topGen‘𝐵) ↾t 𝐴) ⊆ (topGen‘(𝐵 ↾t 𝐴)))
80	51, 79	eqssd 3948	1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (topGen‘(𝐵 ↾t 𝐴)) = ((topGen‘𝐵) ↾t 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∪ cuni 4867  ∪ ciun 4951   ↦ cmpt 5186  ran crn 5652   ↾ cres 5653   “ cima 5654  Fun wfun 6525   Fn wfn 6526  ‘cfv 6531  (class class class)co 7412   ↾_t crest 17571  topGenctg 17588

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-rest 17573  df-topgen 17594

This theorem is used by:  resttop  23458  ordtrest2  23502  2ndcrest  23752  txrest  23930  xkoptsub  23953  xrtgioo  25106  ordtrest2NEW  34537  ptrest  38505