Theorem opnssborel 47752

Description: Open sets of a generalized real Euclidean space are Borel sets (notice that this theorem is even more general, because 𝑋 is not required to be a set). (Contributed by Glauco Siliprandi, 3-Jan-2021.)

Hypotheses

Ref	Expression
opnssborel.a	⊢ 𝐴 = (TopOpen‘(ℝ^‘𝑋))
opnssborel.b	⊢ 𝐵 = (SalGen‘𝐴)

Assertion

Ref	Expression
opnssborel	⊢ 𝐴 ⊆ 𝐵

Proof of Theorem opnssborel

Step	Hyp	Ref	Expression
1		opnssborel.a	. . 3 ⊢ 𝐴 = (TopOpen‘(ℝ^‘𝑋))
2	1	fvexi 6902	. 2 ⊢ 𝐴 ∈ V
3		opnssborel.b	. . 3 ⊢ 𝐵 = (SalGen‘𝐴)
4	3	sssalgen 47452	. 2 ⊢ (𝐴 ∈ V → 𝐴 ⊆ 𝐵)
5	2, 4	ax-mp 5	1 ⊢ 𝐴 ⊆ 𝐵

This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3896  ‘cfv 6541  TopOpenctopn 17599  ℝ^crrx 25711  SalGencsalgen 47429

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-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753

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-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  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-iota 6496  df-fun 6543  df-fv 6549  df-salg 47426  df-salgen 47430

This theorem is used by: (None)