Theorem uniopn 13641

Description: The union of a subset of a topology (that is, the union of any family of open sets of a topology) is an open set. (Contributed by Stefan Allan, 27-Feb-2006.)

Assertion

Ref	Expression
uniopn	⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → ∪ 𝐴 ∈ 𝐽)

Proof of Theorem uniopn

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		istopg 13639	. . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Top ↔ (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 (𝑥 ∩ 𝑦) ∈ 𝐽)))
2	1	ibi 176	. . . 4 ⊢ (𝐽 ∈ Top → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 (𝑥 ∩ 𝑦) ∈ 𝐽))
3	2	simpld 112	. . 3 ⊢ (𝐽 ∈ Top → ∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽))
4		elpw2g 4158	. . . . . . . 8 ⊢ (𝐽 ∈ Top → (𝐴 ∈ 𝒫 𝐽 ↔ 𝐴 ⊆ 𝐽))
5	4	biimpar 297	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → 𝐴 ∈ 𝒫 𝐽)
6		sseq1 3180	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐽 ↔ 𝐴 ⊆ 𝐽))
7		unieq 3820	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
8	7	eleq1d 2246	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 ∈ 𝐽 ↔ ∪ 𝐴 ∈ 𝐽))
9	6, 8	imbi12d 234	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ↔ (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽)))
10	9	spcgv 2826	. . . . . . 7 ⊢ (𝐴 ∈ 𝒫 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽)))
11	5, 10	syl 14	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽)))
12	11	com23 78	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → (𝐴 ⊆ 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → ∪ 𝐴 ∈ 𝐽)))
13	12	ex 115	. . . 4 ⊢ (𝐽 ∈ Top → (𝐴 ⊆ 𝐽 → (𝐴 ⊆ 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → ∪ 𝐴 ∈ 𝐽))))
14	13	pm2.43d 50	. . 3 ⊢ (𝐽 ∈ Top → (𝐴 ⊆ 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → ∪ 𝐴 ∈ 𝐽)))
15	3, 14	mpid 42	. 2 ⊢ (𝐽 ∈ Top → (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽))
16	15	imp 124	1 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → ∪ 𝐴 ∈ 𝐽)

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1351   = wceq 1353   ∈ wcel 2148  ∀wral 2455   ∩ cin 3130   ⊆ wss 3131  𝒫 cpw 3577  ∪ cuni 3811  Topctop 13637

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159  ax-sep 4123

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-in 3137  df-ss 3144  df-pw 3579  df-uni 3812  df-top 13638

This theorem is referenced by:  iunopn  13642  unopn  13645  0opn  13646  topopn  13648  tgtop  13708  ntropn  13757  neipsm  13794  unimopn  14126  metrest  14146  cnopncntop  14177