Theorem resthauslem 23681

Description: Lemma for resthaus 23686 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 4183	. . . . 5 ⊢ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
6		resabs1 5997	. . . . 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 23236	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
11	9, 10	sylib 221	. . . . . 6 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
12		idcn 23575	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
13	11, 12	syl 18	. . . . 5 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
14		eqid 2761	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	cnrest 23603	. . . . 5 ⊢ ((( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽) ∧ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
16	13, 5, 15	sylancl 598	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
17	7, 16	eqeltrrid 2866	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
18	14	restin 23484	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) = (𝐽 ↾t (𝑆 ∩ ∪ 𝐽)))
19	18	oveq1d 7435	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ((𝐽 ↾t 𝑆) Cn 𝐽) = ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
20	17, 19	eleqtrrd 2864	. 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 2145   ∩ cin 3898   ⊆ wss 3899  ∪ cuni 4867   I cid 5545   ↾ cres 5653  –1-1→wf1 6535  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420   ↾_t crest 17591  Topctop 23211  TopOnctopon 23228   Cn ccn 23542

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-map 8849  df-en 8974  df-fin 8977  df-fi 9403  df-rest 17593  df-topgen 17614  df-top 23212  df-topon 23229  df-bases 23264  df-cn 23545

This theorem is used by:  restt0  23684  restt1  23685  resthaus  23686