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 24139
Description: Lemma for ist1-5 24141 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 24138 . . . . 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 24101 . . . . 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 2145   class class class wbr 5103  ‘cfv 6538  Kol2ct0 23624  KQckq 24012   ≃ chmph 24073
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-1o 8476  df-map 8849  df-qtop 17679  df-top 23212  df-topon 23229  df-cn 23545  df-t0 23631  df-kq 24013  df-hmeo 24074  df-hmph 24075
This theorem is used by:  ist1-5  24141  ishaus3  24142
  Copyright terms: Public domain W3C validator