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

Theorem cmphmph 24069
Description: Compactness is a topological property-that is, for any two homeomorphic topologies, either both are compact or neither is. (Contributed by Jeff Hankins, 30-Jun-2009.) (Revised by Mario Carneiro, 23-Aug-2015.)
Assertion
Ref Expression
cmphmph (𝐽 ≃ 𝐾 → (𝐽 ∈ Comp → 𝐾 ∈ Comp))

Proof of Theorem cmphmph
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 hmph 24057 . 2 (𝐽 ≃ 𝐾 ↔ (𝐽Homeo𝐾) ≠ ∅)
2 n0 4299 . . 3 ((𝐽Homeo𝐾) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝐽Homeo𝐾))
3 eqid 2760 . . . . . . 7 ∪ 𝐽 = ∪ 𝐽
4 eqid 2760 . . . . . . 7 ∪ 𝐾 = ∪ 𝐾
53, 4hmeof1o 24045 . . . . . 6 (𝑓 ∈ (𝐽Homeo𝐾) → 𝑓:∪ 𝐽–1-1-onto→∪ 𝐾)
6 f1ofo 6820 . . . . . 6 (𝑓:∪ 𝐽–1-1-onto→∪ 𝐾 → 𝑓:∪ 𝐽–onto→∪ 𝐾)
75, 6syl 18 . . . . 5 (𝑓 ∈ (𝐽Homeo𝐾) → 𝑓:∪ 𝐽–onto→∪ 𝐾)
8 hmeocn 24041 . . . . 5 (𝑓 ∈ (𝐽Homeo𝐾) → 𝑓 ∈ (𝐽 Cn 𝐾))
94cncmp 23672 . . . . . . 7 ((𝐽 ∈ Comp ∧ 𝑓:∪ 𝐽–onto→∪ 𝐾 ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Comp)
1093expb 1138 . . . . . 6 ((𝐽 ∈ Comp ∧ (𝑓:∪ 𝐽–onto→∪ 𝐾 ∧ 𝑓 ∈ (𝐽 Cn 𝐾))) → 𝐾 ∈ Comp)
1110expcom 419 . . . . 5 ((𝑓:∪ 𝐽–onto→∪ 𝐾 ∧ 𝑓 ∈ (𝐽 Cn 𝐾)) → (𝐽 ∈ Comp → 𝐾 ∈ Comp))
127, 8, 11syl2anc 596 . . . 4 (𝑓 ∈ (𝐽Homeo𝐾) → (𝐽 ∈ Comp → 𝐾 ∈ Comp))
1312exlimiv 1963 . . 3 (∃𝑓 𝑓 ∈ (𝐽Homeo𝐾) → (𝐽 ∈ Comp → 𝐾 ∈ Comp))
142, 13sylbi 220 . 2 ((𝐽Homeo𝐾) ≠ ∅ → (𝐽 ∈ Comp → 𝐾 ∈ Comp))
151, 14sylbi 220 1 (𝐽 ≃ 𝐾 → (𝐽 ∈ Comp → 𝐾 ∈ Comp))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1812   ∈ wcel 2145   ≠ wne 2955  ∅c0 4278  ∪ cuni 4866   class class class wbr 5102  –onto→wfo 6525  –1-1-onto→wf1o 6526  (class class class)co 7408   Cn ccn 23504  Compccmp 23666  Homeochmeo 24034   ≃ chmph 24035
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 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-1st 7984  df-2nd 7985  df-1o 8454  df-map 8827  df-en 8952  df-dom 8953  df-fin 8955  df-top 23174  df-topon 23191  df-cn 23507  df-cmp 23667  df-hmeo 24036  df-hmph 24037
This theorem is used by:  ptcmpfi  24094  xrcmp  25231  reheibor  38693
  Copyright terms: Public domain W3C validator