Theorem resthauslem 23690

Description: Lemma for resthaus 23695 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 6868	. . 3 ⊢ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1-onto→(𝑆 ∩ ∪ 𝐽)
3		f1of1 6828	. . 3 ⊢ (( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1-onto→(𝑆 ∩ ∪ 𝐽) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽))
4	2, 3	mp1i 14	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)–1-1→(𝑆 ∩ ∪ 𝐽))
5		inss2 4133	. . . . 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 23245	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
11	9, 10	sylib 221	. . . . . 6 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
12		idcn 23584	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
13	11, 12	syl 18	. . . . 5 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
14		eqid 2760	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	cnrest 23612	. . . . 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 23493	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) = (𝐽 ↾t (𝑆 ∩ ∪ 𝐽)))
19	18	oveq1d 7439	. . 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 1569   ∈ wcel 2144   ⊆ wss 3896   ∩ cin 4088  ∪ cuni 4866   I cid 5545   ↾ cres 5653  –1-1→wf1 6540  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7424   ↾_t crest 17600  Topctop 23220  TopOnctopon 23237   Cn ccn 23551

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  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 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7882  df-1st 8005  df-2nd 8006  df-map 8857  df-en 8982  df-fin 8985  df-fi 9410  df-rest 17602  df-topgen 17623  df-top 23221  df-topon 23238  df-bases 23273  df-cn 23554

This theorem is used by:  restt0  23693  restt1  23694  resthaus  23695