Theorem resthauslem 23572

Description: Lemma for resthaus 23577 and similar theorems. If the topological property 𝐴 is preserved under injective preimages, then property 𝐴 passes to subspaces. (Contributed by Mario Carneiro, 25-Aug-2015.)

Hypotheses

Ref	Expression
resthauslem.1	⊢ (𝐽 ∈ 𝐴 → 𝐽 ∈ Top)
resthauslem.2	⊢ ((𝐽 ∈ 𝐴 ∧ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽) ∧ ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t 𝑆) Cn 𝐽)) → (𝐽 ↾t 𝑆) ∈ 𝐴)

Assertion

Ref	Expression
resthauslem	⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) ∈ 𝐴)

Proof of Theorem resthauslem

Step	Hyp	Ref	Expression
1		simpl 488	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ 𝐴)
2		f1oi 6863	. . 3 ⊢ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1-onto→(𝑆 ∩ ∪ 𝐽)
3		f1of1 6823	. . 3 ⊢ (( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1-onto→(𝑆 ∩ ∪ 𝐽) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽))
4	2, 3	mp1i 14	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽))
5		inss2 4190	. . . . 5 ⊢ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
6		resabs1 6007	. . . . 5 ⊢ ((𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽 → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) = ( I ↾ (𝑆 ∩ ∪ 𝐽)))
7	5, 6	ax-mp 5	. . . 4 ⊢ (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) = ( I ↾ (𝑆 ∩ ∪ 𝐽))
8		resthauslem.1	. . . . . . . 8 ⊢ (𝐽 ∈ 𝐴 → 𝐽 ∈ Top)
9	8	adantr 486	. . . . . . 7 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ Top)
10		toptopon2 23127	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
11	9, 10	sylib 221	. . . . . 6 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
12		idcn 23466	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
13	11, 12	syl 18	. . . . 5 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
14		eqid 2765	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	cnrest 23494	. . . . 5 ⊢ ((( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽) ∧ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
16	13, 5, 15	sylancl 598	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
17	7, 16	eqeltrrid 2870	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
18	14	restin 23375	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) = (𝐽 ↾t (𝑆 ∩ ∪ 𝐽)))
19	18	oveq1d 7434	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ((𝐽 ↾t 𝑆) Cn 𝐽) = ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
20	17, 19	eleqtrrd 2868	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t 𝑆) Cn 𝐽))
21		resthauslem.2	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽) ∧ ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t 𝑆) Cn 𝐽)) → (𝐽 ↾t 𝑆) ∈ 𝐴)
22	1, 4, 20, 21	syl3anc 1398	1 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ∩ cin 3905   ⊆ wss 3906  ∪ cuni 4874   I cid 5557   ↾ cres 5665  –1-1→wf1 6537  –1-1-onto→wf1o 6539  ‘cfv 6540  (class class class)co 7419   ↾_t crest 17497  Topctop 23102  TopOnctopon 23119   Cn ccn 23433

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-map 8832  df-en 8950  df-fin 8953  df-fi 9378  df-rest 17499  df-topgen 17520  df-top 23103  df-topon 23120  df-bases 23155  df-cn 23436

This theorem is used by:  restt0  23575  restt1  23576  resthaus  23577