Theorem cldssbrsiga 34820

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 23347	. . . . . 6 ⊢ (𝑥 ∈ (Clsd‘𝐽) → 𝑥 ⊆ ∪ 𝐽)
3	2	adantl 487	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑥 ⊆ ∪ 𝐽)
4		dfss4 4214	. . . . 5 ⊢ (𝑥 ⊆ ∪ 𝐽 ↔ (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) = 𝑥)
5	3, 4	sylib 221	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ (∪ 𝐽 ∖ 𝑥)) = 𝑥)
6	1	topopn 23224	. . . . . 6 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ 𝐽)
7	1	difopn 23352	. . . . . 6 ⊢ ((∪ 𝐽 ∈ 𝐽 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ 𝑥) ∈ 𝐽)
8	6, 7	sylan 592	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ (Clsd‘𝐽)) → (∪ 𝐽 ∖ 𝑥) ∈ 𝐽)
9		id 23	. . . . . . . 8 ⊢ (𝐽 ∈ Top → 𝐽 ∈ Top)
10	9	sgsiga 34775	. . . . . . 7 ⊢ (𝐽 ∈ Top → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
11	10	adantr 486	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
12		elex 3471	. . . . . . . 8 ⊢ (𝐽 ∈ Top → 𝐽 ∈ V)
13		sigagensiga 34774	. . . . . . . 8 ⊢ (𝐽 ∈ V → (sigaGen‘𝐽) ∈ (sigAlgebra‘∪ 𝐽))
14		baselsiga 34747	. . . . . . . 8 ⊢ ((sigaGen‘𝐽) ∈ (sigAlgebra‘∪ 𝐽) → ∪ 𝐽 ∈ (sigaGen‘𝐽))
15	12, 13, 14	3syl 19	. . . . . . 7 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ (sigaGen‘𝐽))
16	15	adantr 486	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → ∪ 𝐽 ∈ (sigaGen‘𝐽))
17		elsigagen 34780	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (∪ 𝐽 ∖ 𝑥) ∈ 𝐽) → (∪ 𝐽 ∖ 𝑥) ∈ (sigaGen‘𝐽))
18		difelsiga 34767	. . . . . 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 3914	1 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045  ∪ cuni 4866  ran crn 5651  ‘cfv 6538  Topctop 23211  Clsdccld 23334  sigAlgebracsiga 34740  sigaGencsigagen 34771

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 7751  ax-inf2 9642

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  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-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-oi 9504  df-dju 9982  df-card 10020  df-top 23212  df-cld 23337  df-siga 34741  df-sigagen 34772

This theorem is used by:  sxbrsigalem4  34919  sibfinima  34971  sibfof  34972  orvccel  35095