Theorem resthauslem 23589

Description: Lemma for resthaus 23594 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 6857	. . 3 ⊢ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1-onto→(𝑆 ∩ ∪ 𝐽)
3		f1of1 6817	. . 3 ⊢ (( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1-onto→(𝑆 ∩ ∪ 𝐽) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽))
4	2, 3	mp1i 14	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽))
5		inss2 4183	. . . . 5 ⊢ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
6		resabs1 5999	. . . . 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 23144	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
11	9, 10	sylib 221	. . . . . 6 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
12		idcn 23483	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
13	11, 12	syl 18	. . . . 5 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
14		eqid 2760	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	cnrest 23511	. . . . 5 ⊢ ((( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽) ∧ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
16	13, 5, 15	sylancl 598	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
17	7, 16	eqeltrrid 2865	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
18	14	restin 23392	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) = (𝐽 ↾t (𝑆 ∩ ∪ 𝐽)))
19	18	oveq1d 7429	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ((𝐽 ↾t 𝑆) Cn 𝐽) = ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
20	17, 19	eleqtrrd 2863	. 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 5549   ↾ cres 5657  –1-1→wf1 6530  –1-1-onto→wf1o 6532  ‘cfv 6533  (class class class)co 7414   ↾_t crest 17506  Topctop 23119  TopOnctopon 23136   Cn ccn 23450

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-map 8829  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-cn 23453

This theorem is used by:  restt0  23592  restt1  23593  resthaus  23594