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

Theorem sshauslem 23717
Description: Lemma for sshaus 23720 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 6883 . . 3 ( I ↾ 𝑋):𝑋⟶1-1onto𝑋
3 f1of1 6842 . . 3 (( I ↾ 𝑋):𝑋⟶1-1onto𝑋 → ( 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 23262 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
118, 10sylib 221 . . . 4 ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐽 ∈ (TopOn‘𝑋))
12 ssidcn 23600 . . . 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 1399 1 ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∪ cuni 4870   I cid 5549   ↾ cres 5657  ⟶1-1wf1 6552  ⟶1-1ontowf1o 6554  ‘cfv 6555  (class class class)co 7440  Topctop 23238  TopOnctopon 23255   Cn ccn 23569
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-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 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-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-top 23239  df-topon 23256  df-cn 23572
This theorem is used by:  sst0  23718  sst1  23719  sshaus  23720
  Copyright terms: Public domain W3C validator