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

Theorem sshauslem 23538
Description: Lemma for sshaus 23541 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 23083 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
118, 10sylib 221 . . . 4 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽 ∈ (TopOn‘𝑋))
12 ssidcn 23421 . . . 4 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽) ↔ 𝐽𝐾))
136, 11, 12syl2anc 595 . . 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 2143  wss 3905   cuni 4872   I cid 5555  cres 5663  1-1wf1 6533  1-1-ontowf1o 6535  cfv 6536  (class class class)co 7410  Topctop 23059  TopOnctopon 23076   Cn ccn 23390
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-top 23060  df-topon 23077  df-cn 23393
This theorem is used by:  sst0  23539  sst1  23540  sshaus  23541
  Copyright terms: Public domain W3C validator