Theorem opnssborel 47918

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

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ‘cfv 6566  TopOpenctopn 17642  ℝ^crrx 25759  SalGencsalgen 47595

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-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-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-int 4913  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-iota 6520  df-fun 6568  df-fv 6574  df-salg 47592  df-salgen 47596

This theorem is used by: (None)