Theorem restcnrm 23735

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 2763	. . 3 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	restin 23539	. 2 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t 𝐴) = (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)))
3		simpll 779	. . . . . 6 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → 𝐽 ∈ CNrm)
4		elpwi 4567	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽) → 𝑥 ⊆ (𝐴 ∩ ∪ 𝐽))
5	4	adantl 487	. . . . . 6 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → 𝑥 ⊆ (𝐴 ∩ ∪ 𝐽))
6		inex1g 5286	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ ∪ 𝐽) ∈ V)
7	6	ad2antlr 740	. . . . . 6 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → (𝐴 ∩ ∪ 𝐽) ∈ V)
8		restabs 23538	. . . . . 6 ⊢ ((𝐽 ∈ CNrm ∧ 𝑥 ⊆ (𝐴 ∩ ∪ 𝐽) ∧ (𝐴 ∩ ∪ 𝐽) ∈ V) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) = (𝐽 ↾t 𝑥))
9	3, 5, 7, 8	syl3anc 1399	. . . . 5 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) = (𝐽 ↾t 𝑥))
10		cnrmi 23733	. . . . . 6 ⊢ ((𝐽 ∈ CNrm ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → (𝐽 ↾t 𝑥) ∈ Nrm)
11	10	adantlr 728	. . . . 5 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → (𝐽 ↾t 𝑥) ∈ Nrm)
12	9, 11	eqeltrd 2864	. . . 4 ⊢ (((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)) → ((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) ∈ Nrm)
13	12	ralrimiva 3158	. . 3 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → ∀𝑥 ∈ 𝒫 (𝐴 ∩ ∪ 𝐽)((𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ↾t 𝑥) ∈ Nrm)
14		cnrmtop 23710	. . . . . . 7 ⊢ (𝐽 ∈ CNrm → 𝐽 ∈ Top)
15	14	adantr 486	. . . . . 6 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → 𝐽 ∈ Top)
16		toptopon2 23291	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
17	15, 16	sylib 221	. . . . 5 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
18		inss2 4137	. . . . 5 ⊢ (𝐴 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
19		resttopon 23534	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ (𝐴 ∩ ∪ 𝐽) ⊆ ∪ 𝐽) → (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ (TopOn‘(𝐴 ∩ ∪ 𝐽)))
20	17, 18, 19	sylancl 598	. . . 4 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t (𝐴 ∩ ∪ 𝐽)) ∈ (TopOn‘(𝐴 ∩ ∪ 𝐽)))
21		iscnrm2 23711	. . . 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 2864	1 ⊢ ((𝐽 ∈ CNrm ∧ 𝐴 ∈ 𝑉) → (𝐽 ↾t 𝐴) ∈ CNrm)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  (class class class)co 7451   ↾_t crest 17641  Topctop 23266  TopOnctopon 23283  Nrmcnrm 23683  CNrmccnrm 23684

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-rep 5238  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-3or 1104  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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-en 9012  df-fin 9015  df-fi 9440  df-rest 17643  df-topgen 17664  df-top 23267  df-topon 23284  df-bases 23319  df-cnrm 23691

This theorem is used by: (None)