ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ntrcls0 GIF version

Theorem ntrcls0 15122
Description: A subset whose closure has an empty interior also has an empty interior. (Contributed by NM, 4-Oct-2007.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
ntrcls0 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) = ∅)

Proof of Theorem ntrcls0
StepHypRef Expression
1 simpl 109 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝐽 ∈ Top)
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32clsss3 15121 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
42sscls 15111 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
52ntrss 15110 . . . . 5 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋𝑆 ⊆ ((cls‘𝐽)‘𝑆)) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
61, 3, 4, 5syl3anc 1274 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
763adant3 1044 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
8 sseq2 3266 . . . 4 (((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅ → (((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((int‘𝐽)‘𝑆) ⊆ ∅))
983ad2ant3 1047 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → (((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((int‘𝐽)‘𝑆) ⊆ ∅))
107, 9mpbid 147 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) ⊆ ∅)
11 ss0 3553 . 2 (((int‘𝐽)‘𝑆) ⊆ ∅ → ((int‘𝐽)‘𝑆) = ∅)
1210, 11syl 14 1 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) = ∅)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005   = wceq 1398  wcel 2205  wss 3214  c0 3512   cuni 3919  cfv 5357  Topctop 14988  intcnt 15084  clsccl 15085
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-top 14989  df-cld 15086  df-ntr 15087  df-cls 15088
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator