Theorem cldssbrsiga 34731

Description: A Borel Algebra contains all closed sets of its base topology. (Contributed by Thierry Arnoux, 27-Mar-2017.)

Assertion

Ref	Expression
cldssbrsiga	⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))

Proof of Theorem cldssbrsiga

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2760	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	cldss 23286	. . . . . 6 ⊢ (𝑥 ∈ (Clsd‘𝐽) → 𝑥 ⊆ ∪ 𝐽)
3	2	adantl 487	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑥 ⊆ ∪ 𝐽)
4		dfss4 4215	. . . . 5 ⊢ (𝑥 ⊆ ∪ 𝐽 ↔ (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) = 𝑥)
5	3, 4	sylib 221	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) = 𝑥)
6	1	topopn 23163	. . . . . 6 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ 𝐽)
7	1	difopn 23291	. . . . . 6 ⊢ ((∪ 𝐽 ∈ 𝐽 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ 𝑥) ∈ 𝐽)
8	6, 7	sylan 592	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ 𝑥) ∈ 𝐽)
9		id 23	. . . . . . . 8 ⊢ (𝐽 ∈ Top → 𝐽 ∈ Top)
10	9	sgsiga 34686	. . . . . . 7 ⊢ (𝐽 ∈ Top → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
11	10	adantr 486	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
12		elex 3471	. . . . . . . 8 ⊢ (𝐽 ∈ Top → 𝐽 ∈ V)
13		sigagensiga 34685	. . . . . . . 8 ⊢ (𝐽 ∈ V → (sigaGen‘𝐽) ∈ (sigAlgebra‘∪ 𝐽))
14		baselsiga 34658	. . . . . . . 8 ⊢ ((sigaGen‘𝐽) ∈ (sigAlgebra‘∪ 𝐽) → ∪ 𝐽 ∈ (sigaGen‘𝐽))
15	12, 13, 14	3syl 19	. . . . . . 7 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ (sigaGen‘𝐽))
16	15	adantr 486	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → ∪ 𝐽 ∈ (sigaGen‘𝐽))
17		elsigagen 34691	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → (∪ 𝐽 ∖ 𝑥) ∈ (sigaGen‘𝐽))
18		difelsiga 34678	. . . . . 6 ⊢ (((sigaGen‘𝐽) ∈ ∪ ran sigAlgebra ∧ ∪ 𝐽 ∈ (sigaGen‘𝐽) ∧ (∪ 𝐽 ∖ 𝑥) ∈ (sigaGen‘𝐽)) → (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) ∈ (sigaGen‘𝐽))
19	11, 16, 17, 18	syl3anc 1398	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) ∈ (sigaGen‘𝐽))
20	8, 19	syldan 603	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) ∈ (sigaGen‘𝐽))
21	5, 20	eqeltrrd 2861	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑥 ∈ (sigaGen‘𝐽))
22	21	ex 418	. 2 ⊢ (𝐽 ∈ Top → (𝑥 ∈ (Clsd‘𝐽) → 𝑥 ∈ (sigaGen‘𝐽)))
23	22	ssrdv 3937	1 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∖ cdif 3896   ⊆ wss 3899  ∪ cuni 4867  ran crn 5656  ‘cfv 6535  Topctop 23150  Clsdccld 23273  sigAlgebracsiga 34651  sigaGencsigagen 34682

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742  ax-inf2 9627

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6301  df-ord 6362  df-on 6363  df-lim 6364  df-suc 6365  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-isom 6544  df-riota 7373  df-ov 7419  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8285  df-wrecs 8316  df-recs 8365  df-rdg 8404  df-1o 8462  df-2o 8463  df-er 8703  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-oi 9489  df-dju 9931  df-card 9969  df-top 23151  df-cld 23276  df-siga 34652  df-sigagen 34683

This theorem is used by:  sxbrsigalem4  34831  sibfinima  34883  sibfof  34884  orvccel  35007