Theorem resthauslem 23736

Description: Lemma for resthaus 23741 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 6894	. . 3 ⊢ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)⟶1-1onto(𝑆 ∩ ∪ 𝐽)
3		f1of1 6853	. . 3 ⊢ (( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)⟶1-1onto(𝑆 ∩ ∪ 𝐽) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)⟶1-1(𝑆 ∩ ∪ 𝐽))
4	2, 3	mp1i 14	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)⟶1-1(𝑆 ∩ ∪ 𝐽))
5		inss2 4137	. . . . 5 ⊢ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽
6		resabs1 6014	. . . . 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 23291	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
11	9, 10	sylib 221	. . . . . 6 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → 𝐽 ∈ (TopOn‘∪ 𝐽))
12		idcn 23630	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
13	11, 12	syl 18	. . . . 5 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽))
14		eqid 2763	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14	cnrest 23658	. . . . 5 ⊢ ((( I ↾ ∪ 𝐽) ∈ (𝐽 Cn 𝐽) ∧ (𝑆 ∩ ∪ 𝐽) ⊆ ∪ 𝐽) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
16	13, 5, 15	sylancl 598	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (( I ↾ ∪ 𝐽) ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
17	7, 16	eqeltrrid 2869	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
18	14	restin 23539	. . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) = (𝐽 ↾t (𝑆 ∩ ∪ 𝐽)))
19	18	oveq1d 7466	. . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ((𝐽 ↾t 𝑆) Cn 𝐽) = ((𝐽 ↾t (𝑆 ∩ ∪ 𝐽)) Cn 𝐽))
20	17, 19	eleqtrrd 2867	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t 𝑆) Cn 𝐽))
21		resthauslem.2	. 2 ⊢ ((𝐽 ∈ 𝐴 ∧ ( I ↾ (𝑆 ∩ ∪ 𝐽)):(𝑆 ∩ ∪ 𝐽)⟶1-1(𝑆 ∩ ∪ 𝐽) ∧ ( I ↾ (𝑆 ∩ ∪ 𝐽)) ∈ ((𝐽 ↾t 𝑆) Cn 𝐽)) → (𝐽 ↾t 𝑆) ∈ 𝐴)
22	1, 4, 20, 21	syl3anc 1399	1 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝑆 ∈ 𝑉) → (𝐽 ↾t 𝑆) ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092  ∪ cuni 4872   I cid 5552   ↾ cres 5660  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ↾_t crest 17641  Topctop 23266  TopOnctopon 23283   Cn ccn 23597

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-map 8887  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-cn 23600

This theorem is used by:  restt0  23739  restt1  23740  resthaus  23741