Theorem kgeni 23862

Description: Property of the open sets in the compact generator. (Contributed by Mario Carneiro, 20-Mar-2015.)

Assertion

Ref	Expression
kgeni	⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t 𝐾))

Proof of Theorem kgeni

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

Step	Hyp	Ref	Expression
1		inass 4124	. . . . 5 ⊢ ((𝐴 ∩ 𝐾) ∩ ∪ 𝐽) = (𝐴 ∩ (𝐾 ∩ ∪ 𝐽))
2		in32 4126	. . . . 5 ⊢ ((𝐴 ∩ 𝐾) ∩ ∪ 𝐽) = ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾)
3	1, 2	eqtr3i 2785	. . . 4 ⊢ (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) = ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾)
4		df-kgen 23859	. . . . . . . . . . 11 ⊢ 𝑘Gen = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑦 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑦) ∈ Comp → (𝑥 ∩ 𝑦) ∈ (𝑗 ↾t 𝑦))})
5	4	mptrcl 7004	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑘Gen‘𝐽) → 𝐽 ∈ Top)
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐽 ∈ Top)
7		toptopon2 23242	. . . . . . . . 9 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
8	6, 7	sylib 221	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐽 ∈ (TopOn‘∪ 𝐽))
9		simpl 488	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐴 ∈ (𝑘Gen‘𝐽))
10		elkgen 23861	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → (𝐴 ∈ (𝑘Gen‘𝐽) ↔ (𝐴 ⊆ ∪ 𝐽 ∧ ∀𝑦 ∈ 𝒫 ∪ 𝐽((𝐽 ↾t 𝑦) ∈ Comp → (𝐴 ∩ 𝑦) ∈ (𝐽 ↾t 𝑦)))))
11	10	biimpa 482	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐴 ∈ (𝑘Gen‘𝐽)) → (𝐴 ⊆ ∪ 𝐽 ∧ ∀𝑦 ∈ 𝒫 ∪ 𝐽((𝐽 ↾t 𝑦) ∈ Comp → (𝐴 ∩ 𝑦) ∈ (𝐽 ↾t 𝑦))))
12	8, 9, 11	syl2anc 596	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ⊆ ∪ 𝐽 ∧ ∀𝑦 ∈ 𝒫 ∪ 𝐽((𝐽 ↾t 𝑦) ∈ Comp → (𝐴 ∩ 𝑦) ∈ (𝐽 ↾t 𝑦))))
13	12	simpld 500	. . . . . 6 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐴 ⊆ ∪ 𝐽)
14		dfss2 4094	. . . . . 6 ⊢ (𝐴 ⊆ ∪ 𝐽 ↔ (𝐴 ∩ ∪ 𝐽) = 𝐴)
15	13, 14	sylib 221	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ ∪ 𝐽) = 𝐴)
16	15	ineq1d 4116	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾) = (𝐴 ∩ 𝐾))
17	3, 16	eqtrid 2807	. . 3 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) = (𝐴 ∩ 𝐾))
18		cmptop 23719	. . . . . . . 8 ⊢ ((𝐽 ↾t 𝐾) ∈ Comp → (𝐽 ↾t 𝐾) ∈ Top)
19	18	adantl 487	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t 𝐾) ∈ Top)
20		restrcl 23481	. . . . . . . 8 ⊢ ((𝐽 ↾t 𝐾) ∈ Top → (𝐽 ∈ V ∧ 𝐾 ∈ V))
21	20	simprd 501	. . . . . . 7 ⊢ ((𝐽 ↾t 𝐾) ∈ Top → 𝐾 ∈ V)
22	19, 21	syl 18	. . . . . 6 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐾 ∈ V)
23		eqid 2760	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
24	23	restin 23490	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ V) → (𝐽 ↾t 𝐾) = (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
25	6, 22, 24	syl2anc 596	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t 𝐾) = (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
26		simpr 490	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t 𝐾) ∈ Comp)
27	25, 26	eqeltrrd 2861	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp)
28		oveq2 7429	. . . . . . 7 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (𝐽 ↾t 𝑦) = (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
29	28	eleq1d 2845	. . . . . 6 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → ((𝐽 ↾t 𝑦) ∈ Comp ↔ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp))
30		ineq2 4111	. . . . . . 7 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (𝐴 ∩ 𝑦) = (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)))
31	30, 28	eleq12d 2854	. . . . . 6 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → ((𝐴 ∩ 𝑦) ∈ (𝐽 ↾t 𝑦) ↔ (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽))))
32	29, 31	imbi12d 347	. . . . 5 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (((𝐽 ↾t 𝑦) ∈ Comp → (𝐴 ∩ 𝑦) ∈ (𝐽 ↾t 𝑦)) ↔ ((𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))))
33	12	simprd 501	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ∀𝑦 ∈ 𝒫 ∪ 𝐽((𝐽 ↾t 𝑦) ∈ Comp → (𝐴 ∩ 𝑦) ∈ (𝐽 ↾t 𝑦)))
34		inss2 4134	. . . . . 6 ⊢ (𝐾 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
35		inex1g 5278	. . . . . . 7 ⊢ (𝐾 ∈ V → (𝐾 ∩ ∪ 𝐽) ∈ V)
36		elpwg 4559	. . . . . . 7 ⊢ ((𝐾 ∩ ∪ 𝐽) ∈ V → ((𝐾 ∩ ∪ 𝐽) ∈ 𝒫 ∪ 𝐽 ↔ (𝐾 ∩ ∪ 𝐽) ⊆ ∪ 𝐽))
37	22, 35, 36	3syl 19	. . . . . 6 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐾 ∩ ∪ 𝐽) ∈ 𝒫 ∪ 𝐽 ↔ (𝐾 ∩ ∪ 𝐽) ⊆ ∪ 𝐽))
38	34, 37	mpbiri 261	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐾 ∩ ∪ 𝐽) ∈ 𝒫 ∪ 𝐽)
39	32, 33, 38	rspcdva 3577	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽))))
40	27, 39	mpd 16	. . 3 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
41	17, 40	eqeltrrd 2861	. 2 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
42	41, 25	eleqtrrd 2863	1 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t 𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  ∪ cuni 4866  ‘cfv 6539  (class class class)co 7421   ↾_t crest 17597  Topctop 23217  TopOnctopon 23234  Compccmp 23710  𝑘Genckgen 23858

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-rest 17599  df-top 23218  df-topon 23235  df-cmp 23711  df-kgen 23859

This theorem is used by:  kgentopon  23863  kgencmp  23870  kgenidm  23872  llycmpkgen2  23875  1stckgen  23879  kgencn3  23883  txkgen  23977