MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sshauslem Structured version   Visualization version   GIF version

Theorem sshauslem 23629
Description: Lemma for sshaus 23632 and similar theorems. If the topological property 𝐴 is preserved under injective preimages, then a topology finer than one with property 𝐴 also has property 𝐴. (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypotheses
Ref Expression
t1sep.1 𝑋 = 𝐽
sshauslem.2 (𝐽𝐴𝐽 ∈ Top)
sshauslem.3 ((𝐽𝐴 ∧ ( I ↾ 𝑋):𝑋1-1𝑋 ∧ ( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽)) → 𝐾𝐴)
Assertion
Ref Expression
sshauslem ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐾𝐴)

Proof of Theorem sshauslem
StepHypRef Expression
1 simp1 1154 . 2 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽𝐴)
2 f1oi 6859 . . 3 ( I ↾ 𝑋):𝑋1-1-onto𝑋
3 f1of1 6819 . . 3 (( I ↾ 𝑋):𝑋1-1-onto𝑋 → ( I ↾ 𝑋):𝑋1-1𝑋)
42, 3mp1i 14 . 2 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → ( I ↾ 𝑋):𝑋1-1𝑋)
5 simp3 1156 . . 3 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽𝐾)
6 simp2 1155 . . . 4 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐾 ∈ (TopOn‘𝑋))
7 sshauslem.2 . . . . . 6 (𝐽𝐴𝐽 ∈ Top)
873ad2ant1 1151 . . . . 5 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽 ∈ Top)
9 t1sep.1 . . . . . 6 𝑋 = 𝐽
109toptopon 23174 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
118, 10sylib 221 . . . 4 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽 ∈ (TopOn‘𝑋))
12 ssidcn 23512 . . . 4 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽) ↔ 𝐽𝐾))
136, 11, 12syl2anc 596 . . 3 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽) ↔ 𝐽𝐾))
145, 13mpbird 260 . 2 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → ( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽))
15 sshauslem.3 . 2 ((𝐽𝐴 ∧ ( I ↾ 𝑋):𝑋1-1𝑋 ∧ ( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽)) → 𝐾𝐴)
161, 4, 14, 15syl3anc 1398 1 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐾𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  w3a 1103   = wceq 1570  wcel 2145  wss 3899   cuni 4867   I cid 5549  cres 5657  1-1wf1 6532  1-1-ontowf1o 6534  cfv 6535  (class class class)co 7416  Topctop 23150  TopOnctopon 23167   Cn ccn 23481
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-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8835  df-top 23151  df-topon 23168  df-cn 23484
This theorem is used by:  sst0  23630  sst1  23631  sshaus  23632
  Copyright terms: Public domain W3C validator