Theorem opnssborel 47463

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 6892	. 2 ⊢ 𝐴 ∈ V
3		opnssborel.b	. . 3 ⊢ 𝐵 = (SalGen‘𝐴)
4	3	sssalgen 47163	. 2 ⊢ (𝐴 ∈ V → 𝐴 ⊆ 𝐵)
5	2, 4	ax-mp 5	1 ⊢ 𝐴 ⊆ 𝐵

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3899  ‘cfv 6533  TopOpenctopn 17506  ℝ^crrx 25611  SalGencsalgen 47140

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-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 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 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-int 4908  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-salg 47137  df-salgen 47141

This theorem is used by: (None)