Theorem restcnrm 23588

Description: A subspace of a completely normal space is completely normal. (Contributed by Mario Carneiro, 26-Aug-2015.)

Assertion

Ref	Expression
restcnrm	⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t 𝐴) ∈ CNrm)

Proof of Theorem restcnrm

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2760	. . 3 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	restin 23392	. 2 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t 𝐴) = (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)))
3		simpll 779	. . . . . 6 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → 𝐽 ∈ CNrm)
4		elpwi 4564	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽) → 𝑥 ⊆ (𝐴 ∩ ∪ 𝐽))
5	4	adantl 487	. . . . . 6 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → 𝑥 ⊆ (𝐴 ∩ ∪ 𝐽))
6		inex1g 5282	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ ∪ 𝐽) ∈ V)
7	6	ad2antlr 740	. . . . . 6 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → (𝐴 ∩ ∪ 𝐽) ∈ V)
8		restabs 23391	. . . . . 6 ⊢ ((𝐽 ∈ CNrm ∧ 𝑥 ⊆ (𝐴 ∩ ∪ 𝐽) ∧ (𝐴 ∩ ∪ 𝐽) ∈ V) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) = (𝐽 ↾t 𝑥))
9	3, 5, 7, 8	syl3anc 1398	. . . . 5 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) = (𝐽 ↾t 𝑥))
10		cnrmi 23586	. . . . . 6 ⊢ ((𝐽 ∈ CNrm ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → (𝐽 ↾t 𝑥) ∈ Nrm)
11	10	adantlr 728	. . . . 5 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → (𝐽 ↾t 𝑥) ∈ Nrm)
12	9, 11	eqeltrd 2860	. . . 4 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) ∈ Nrm)
13	12	ralrimiva 3154	. . 3 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → ∀𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) ∈ Nrm)
14		cnrmtop 23563	. . . . . . 7 ⊢ (𝐽 ∈ CNrm → 𝐽 ∈ Top)
15	14	adantr 486	. . . . . 6 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → 𝐽 ∈ Top)
16		toptopon2 23144	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
17	15, 16	sylib 221	. . . . 5 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
18		inss2 4183	. . . . 5 ⊢ (𝐴 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
19		resttopon 23387	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ (𝐴 ∩ ∪ 𝐽) ⊆ ∪ 𝐽) → (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ (TopOn‘(𝐴 ∩ ∪ 𝐽)))
20	17, 18, 19	sylancl 598	. . . 4 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ (TopOn‘(𝐴 ∩ ∪ 𝐽)))
21		iscnrm2 23564	. . . 4 ⊢ ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ (TopOn‘(𝐴 ∩ ∪ 𝐽)) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ CNrm ↔ ∀𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) ∈ Nrm))
22	20, 21	syl 18	. . 3 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ CNrm ↔ ∀𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) ∈ Nrm))
23	13, 22	mpbird 260	. 2 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ CNrm)
24	2, 23	eqeltrd 2860	1 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t 𝐴) ∈ CNrm)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6533  (class class class)co 7414   ↾_t crest 17506  Topctop 23119  TopOnctopon 23136  Nrmcnrm 23536  CNrmccnrm 23537

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-reu 3366  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-pss 3919  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-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-en 8954  df-fin 8957  df-fi 9382  df-rest 17508  df-topgen 17529  df-top 23120  df-topon 23137  df-bases 23172  df-cnrm 23544

This theorem is used by: (None)