Theorem kgeni 23911

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 4127	. . . . 5 ⊢ ((𝐴 ∩ 𝐾) ∩ ∪ 𝐽) = (𝐴 ∩ (𝐾 ∩ ∪ 𝐽))
2		in32 4129	. . . . 5 ⊢ ((𝐴 ∩ 𝐾) ∩ ∪ 𝐽) = ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾)
3	1, 2	eqtr3i 2788	. . . 4 ⊢ (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) = ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾)
4		df-kgen 23908	. . . . . . . . . . 11 ⊢ 𝑘Gen = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑦 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑦) ∈ Comp → (𝑥 ∩ 𝑦) ∈ (𝑗 ↾t 𝑦))})
5	4	mptrcl 7034	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑘Gen‘𝐽) → 𝐽 ∈ Top)
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐽 ∈ Top)
7		toptopon2 23291	. . . . . . . . 9 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
8	6, 7	sylib 221	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐽 ∈ (TopOn‘∪ 𝐽))
9		simpl 488	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → 𝐴 ∈ (𝑘Gen‘𝐽))
10		elkgen 23910	. . . . . . . . 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 4097	. . . . . 6 ⊢ (𝐴 ⊆ ∪ 𝐽 ↔ (𝐴 ∩ ∪ 𝐽) = 𝐴)
15	13, 14	sylib 221	. . . . 5 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ ∪ 𝐽) = 𝐴)
16	15	ineq1d 4119	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐴 ∩ ∪ 𝐽) ∩ 𝐾) = (𝐴 ∩ 𝐾))
17	3, 16	eqtrid 2810	. . 3 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) = (𝐴 ∩ 𝐾))
18		cmptop 23768	. . . . . . . 8 ⊢ ((𝐽 ↾t 𝐾) ∈ Comp → (𝐽 ↾t 𝐾) ∈ Top)
19	18	adantl 487	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t 𝐾) ∈ Top)
20		restrcl 23530	. . . . . . . 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 2763	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
24	23	restin 23539	. . . . . 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 2865	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp)
28		oveq2 7459	. . . . . . 7 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (𝐽 ↾t 𝑦) = (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
29	28	eleq1d 2849	. . . . . 6 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → ((𝐽 ↾t 𝑦) ∈ Comp ↔ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp))
30		ineq2 4114	. . . . . . 7 ⊢ (𝑦 = (𝐾 ∩ ∪ 𝐽) → (𝐴 ∩ 𝑦) = (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)))
31	30, 28	eleq12d 2858	. . . . . 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 4137	. . . . . 6 ⊢ (𝐾 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
35		inex1g 5286	. . . . . . 7 ⊢ (𝐾 ∈ V → (𝐾 ∩ ∪ 𝐽) ∈ V)
36		elpwg 4563	. . . . . . 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 3581	. . . 4 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → ((𝐽 ↾t (𝐾 ∩ ∪ 𝐽)) ∈ Comp → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽))))
40	27, 39	mpd 16	. . 3 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ (𝐾 ∩ ∪ 𝐽)) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
41	17, 40	eqeltrrd 2865	. 2 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t (𝐾 ∩ ∪ 𝐽)))
42	41, 25	eleqtrrd 2867	1 ⊢ ((𝐴 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝐾) ∈ Comp) → (𝐴 ∩ 𝐾) ∈ (𝐽 ↾t 𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  (class class class)co 7451   ↾_t crest 17641  Topctop 23266  TopOnctopon 23283  Compccmp 23759  𝑘Genckgen 23907

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-rest 17643  df-top 23267  df-topon 23284  df-cmp 23760  df-kgen 23908

This theorem is used by:  kgentopon  23912  kgencmp  23919  kgenidm  23921  llycmpkgen2  23924  1stckgen  23928  kgencn3  23932  txkgen  24026