Theorem kgeni 23849

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 4173	. . . . 5 ⊢ ((𝐴 ∩ 𝐾) ∩ ∪ 𝐽) = (𝐴 ∩ (𝐾 ∩ ∪ 𝐽))
2		in32 4175	. . . . 5 ⊢ ((𝐴 ∩ 𝐾) ∩ ∪ 𝐽) = ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾)
3	1, 2	eqtr3i 2786	. . . 4 ⊢ (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) = ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾)
4		df-kgen 23846	. . . . . . . . . . 11 ⊢ 𝑘Gen = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑦 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑦) ∈ Comp → (𝑥 ∩ 𝑦) ∈ (𝑗 ↾t 𝑦))})
5	4	mptrcl 7001	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑘Gen‘𝐽) → 𝐽 ∈ Top)
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐽 ∈ Top)
7		toptopon2 23229	. . . . . . . . 9 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
8	6, 7	sylib 221	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐽 ∈ (TopOn‘∪ 𝐽))
9		simpl 488	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐴 ∈ (𝑘Gen‘𝐽))
10		elkgen 23848	. . . . . . . . 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 3917	. . . . . 6 ⊢ (𝐴 ⊆ ∪ 𝐽 ↔ (𝐴 ∩ ∪ 𝐽) = 𝐴)
15	13, 14	sylib 221	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ ∪ 𝐽) = 𝐴)
16	15	ineq1d 4165	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾) = (𝐴 ∩ 𝐾))
17	3, 16	eqtrid 2808	. . 3 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) = (𝐴 ∩ 𝐾))
18		cmptop 23706	. . . . . . . 8 ⊢ ((𝐽 ↾t 𝐾) ∈ Comp → (𝐽 ↾t 𝐾) ∈ Top)
19	18	adantl 487	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t 𝐾) ∈ Top)
20		restrcl 23468	. . . . . . . 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 2761	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
24	23	restin 23477	. . . . . 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 2862	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp)
28		oveq2 7426	. . . . . . 7 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (𝐽 ↾t 𝑦) = (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
29	28	eleq1d 2846	. . . . . 6 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → ((𝐽 ↾t 𝑦) ∈ Comp ↔ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp))
30		ineq2 4160	. . . . . . 7 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (𝐴 ∩ 𝑦) = (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)))
31	30, 28	eleq12d 2855	. . . . . 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 4183	. . . . . 6 ⊢ (𝐾 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
35		inex1g 5279	. . . . . . 7 ⊢ (𝐾 ∈ V → (𝐾 ∩ ∪ 𝐽) ∈ V)
36		elpwg 4560	. . . . . . 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 3578	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽))))
40	27, 39	mpd 16	. . 3 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
41	17, 40	eqeltrrd 2862	. 2 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
42	41, 25	eleqtrrd 2864	1 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t 𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6537  (class class class)co 7418   ↾_t crest 17584  Topctop 23204  TopOnctopon 23221  Compccmp 23697  𝑘Genckgen 23845

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 7749

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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-rest 17586  df-top 23205  df-topon 23222  df-cmp 23698  df-kgen 23846

This theorem is used by:  kgentopon  23850  kgencmp  23857  kgenidm  23859  llycmpkgen2  23862  1stckgen  23866  kgencn3  23870  txkgen  23964