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

Theorem connsubclo 21275
 Description: If a clopen set meets a connected subspace, it must contain the entire subspace. (Contributed by Mario Carneiro, 10-Mar-2015.)
Hypotheses
Ref Expression
connsubclo.1 𝑋 = 𝐽
connsubclo.3 (𝜑𝐴𝑋)
connsubclo.4 (𝜑 → (𝐽t 𝐴) ∈ Conn)
connsubclo.5 (𝜑𝐵𝐽)
connsubclo.6 (𝜑 → (𝐵𝐴) ≠ ∅)
connsubclo.7 (𝜑𝐵 ∈ (Clsd‘𝐽))
Assertion
Ref Expression
connsubclo (𝜑𝐴𝐵)

Proof of Theorem connsubclo
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2651 . . . 4 (𝐽t 𝐴) = (𝐽t 𝐴)
2 connsubclo.4 . . . 4 (𝜑 → (𝐽t 𝐴) ∈ Conn)
3 connsubclo.7 . . . . . 6 (𝜑𝐵 ∈ (Clsd‘𝐽))
4 cldrcl 20878 . . . . . 6 (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
53, 4syl 17 . . . . 5 (𝜑𝐽 ∈ Top)
6 connsubclo.1 . . . . . . . 8 𝑋 = 𝐽
76topopn 20759 . . . . . . 7 (𝐽 ∈ Top → 𝑋𝐽)
85, 7syl 17 . . . . . 6 (𝜑𝑋𝐽)
9 connsubclo.3 . . . . . 6 (𝜑𝐴𝑋)
108, 9ssexd 4838 . . . . 5 (𝜑𝐴 ∈ V)
11 connsubclo.5 . . . . 5 (𝜑𝐵𝐽)
12 elrestr 16136 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴 ∈ V ∧ 𝐵𝐽) → (𝐵𝐴) ∈ (𝐽t 𝐴))
135, 10, 11, 12syl3anc 1366 . . . 4 (𝜑 → (𝐵𝐴) ∈ (𝐽t 𝐴))
14 connsubclo.6 . . . 4 (𝜑 → (𝐵𝐴) ≠ ∅)
15 eqid 2651 . . . . . 6 (𝐵𝐴) = (𝐵𝐴)
16 ineq1 3840 . . . . . . . 8 (𝑥 = 𝐵 → (𝑥𝐴) = (𝐵𝐴))
1716eqeq2d 2661 . . . . . . 7 (𝑥 = 𝐵 → ((𝐵𝐴) = (𝑥𝐴) ↔ (𝐵𝐴) = (𝐵𝐴)))
1817rspcev 3340 . . . . . 6 ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝐵𝐴) = (𝐵𝐴)) → ∃𝑥 ∈ (Clsd‘𝐽)(𝐵𝐴) = (𝑥𝐴))
193, 15, 18sylancl 695 . . . . 5 (𝜑 → ∃𝑥 ∈ (Clsd‘𝐽)(𝐵𝐴) = (𝑥𝐴))
206restcld 21024 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((𝐵𝐴) ∈ (Clsd‘(𝐽t 𝐴)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(𝐵𝐴) = (𝑥𝐴)))
215, 9, 20syl2anc 694 . . . . 5 (𝜑 → ((𝐵𝐴) ∈ (Clsd‘(𝐽t 𝐴)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(𝐵𝐴) = (𝑥𝐴)))
2219, 21mpbird 247 . . . 4 (𝜑 → (𝐵𝐴) ∈ (Clsd‘(𝐽t 𝐴)))
231, 2, 13, 14, 22connclo 21266 . . 3 (𝜑 → (𝐵𝐴) = (𝐽t 𝐴))
246restuni 21014 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋) → 𝐴 = (𝐽t 𝐴))
255, 9, 24syl2anc 694 . . 3 (𝜑𝐴 = (𝐽t 𝐴))
2623, 25eqtr4d 2688 . 2 (𝜑 → (𝐵𝐴) = 𝐴)
27 sseqin2 3850 . 2 (𝐴𝐵 ↔ (𝐵𝐴) = 𝐴)
2826, 27sylibr 224 1 (𝜑𝐴𝐵)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   = wceq 1523   ∈ wcel 2030   ≠ wne 2823  ∃wrex 2942  Vcvv 3231   ∩ cin 3606   ⊆ wss 3607  ∅c0 3948  ∪ cuni 4468  ‘cfv 5926  (class class class)co 6690   ↾t crest 16128  Topctop 20746  Clsdccld 20868  Conncconn 21262 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-oadd 7609  df-er 7787  df-en 7998  df-fin 8001  df-fi 8358  df-rest 16130  df-topgen 16151  df-top 20747  df-topon 20764  df-bases 20798  df-cld 20871  df-conn 21263 This theorem is referenced by:  conncn  21277  conncompclo  21286
 Copyright terms: Public domain W3C validator