MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ist1-5lem Structured version   Visualization version   GIF version

Theorem ist1-5lem 24194
Description: Lemma for ist1-5 24196 and similar theorems. If 𝐴 is a topological property which implies T0, such as T1 or T2, the property can be "decomposed" into T0 and a non-T0 version of property 𝐴 (which is defined as stating that the Kolmogorov quotient of the space has property 𝐴). For example, if 𝐴 is T1, then the theorem states that a space is T1 iff it is T0 and its Kolmogorov quotient is T1 (we call this property R0). (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypotheses
Ref Expression
ist1-5lem.1 (𝐽 ∈ 𝐴 → 𝐽 ∈ Kol2)
ist1-5lem.2 (𝐽 ≃ (KQ‘𝐽) → (𝐽 ∈ 𝐴 → (KQ‘𝐽) ∈ 𝐴))
ist1-5lem.3 ((KQ‘𝐽) ≃ 𝐽 → ((KQ‘𝐽) ∈ 𝐴 → 𝐽 ∈ 𝐴))
Assertion
Ref Expression
ist1-5lem (𝐽 ∈ 𝐴 ↔ (𝐽 ∈ Kol2 ∧ (KQ‘𝐽) ∈ 𝐴))

Proof of Theorem ist1-5lem
StepHypRef Expression
1 ist1-5lem.1 . . 3 (𝐽 ∈ 𝐴 → 𝐽 ∈ Kol2)
2 kqhmph 24193 . . . . 5 (𝐽 ∈ Kol2 ↔ 𝐽 ≃ (KQ‘𝐽))
31, 2sylib 221 . . . 4 (𝐽 ∈ 𝐴 → 𝐽 ≃ (KQ‘𝐽))
4 ist1-5lem.2 . . . 4 (𝐽 ≃ (KQ‘𝐽) → (𝐽 ∈ 𝐴 → (KQ‘𝐽) ∈ 𝐴))
53, 4mpcom 39 . . 3 (𝐽 ∈ 𝐴 → (KQ‘𝐽) ∈ 𝐴)
61, 5jca 521 . 2 (𝐽 ∈ 𝐴 → (𝐽 ∈ Kol2 ∧ (KQ‘𝐽) ∈ 𝐴))
7 hmphsym 24156 . . . . 5 (𝐽 ≃ (KQ‘𝐽) → (KQ‘𝐽) ≃ 𝐽)
82, 7sylbi 220 . . . 4 (𝐽 ∈ Kol2 → (KQ‘𝐽) ≃ 𝐽)
9 ist1-5lem.3 . . . 4 ((KQ‘𝐽) ≃ 𝐽 → ((KQ‘𝐽) ∈ 𝐴 → 𝐽 ∈ 𝐴))
108, 9syl 18 . . 3 (𝐽 ∈ Kol2 → ((KQ‘𝐽) ∈ 𝐴 → 𝐽 ∈ 𝐴))
1110imp 412 . 2 ((𝐽 ∈ Kol2 ∧ (KQ‘𝐽) ∈ 𝐴) → 𝐽 ∈ 𝐴)
126, 11impbii 212 1 (𝐽 ∈ 𝐴 ↔ (𝐽 ∈ Kol2 ∧ (KQ‘𝐽) ∈ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147   class class class wbr 5108  ‘cfv 6566  Kol2ct0 23679  KQckq 24067   ≃ chmph 24128
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-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-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-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  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-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-1st 8035  df-2nd 8036  df-1o 8514  df-map 8887  df-qtop 17729  df-top 23267  df-topon 23284  df-cn 23600  df-t0 23686  df-kq 24068  df-hmeo 24129  df-hmph 24130
This theorem is used by:  ist1-5  24196  ishaus3  24197
  Copyright terms: Public domain W3C validator