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

Theorem sshauslem 23584
Description: Lemma for sshaus 23587 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 6864 . . 3 ( I ↾ 𝑋):𝑋1-1-onto𝑋
3 f1of1 6824 . . 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 23129 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
118, 10sylib 221 . . . 4 ((𝐽𝐴𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽 ∈ (TopOn‘𝑋))
12 ssidcn 23467 . . . 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 2146  wss 3906   cuni 4874   I cid 5557  cres 5665  1-1wf1 6538  1-1-ontowf1o 6540  cfv 6541  (class class class)co 7420  Topctop 23105  TopOnctopon 23122   Cn ccn 23436
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7743
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6497  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8833  df-top 23106  df-topon 23123  df-cn 23439
This theorem is used by:  sst0  23585  sst1  23586  sshaus  23587
  Copyright terms: Public domain W3C validator